Match LIST-I with LIST-II

Choose the correct answer from the options given below:
Step 1: Examine the graphs and adjacency matrices.
The adjacency matrix for a graph shows the connections (edges) between the nodes. A 1 represents an edge between two nodes, and a 0 represents no edge.
Step 2: Match each graph with its corresponding adjacency matrix.
- **A**: The graph in option A corresponds to adjacency matrix **I** because it shows two nodes connected to others in the same pattern.
- **B**: The graph in option B corresponds to adjacency matrix **II** because of the pattern of connected nodes.
- **C**: The graph in option C corresponds to adjacency matrix **III** based on its connections.
- **D**: The graph in option D corresponds to adjacency matrix **IV** based on the connections between the nodes.
Step 3: Conclusion.
Thus, the correct matching is **A - I, B - II, C - III, D - IV**.
Find the least upper bound and greatest lower bound of \( S = \{X, Y, Z\} \) if they exist, of the poset whose Hasse diagram is shown below:
Suppose \( D_1 = (S_1, \Sigma, q_1, F_1, \delta_1) \) and \( D_2 = (S_2, \Sigma, q_2, F_2, \delta_2) \) are finite automata accepting languages \( L_1 \) and \( L_2 \), respectively. Then, which of the following languages will also be accepted by the finite automata:
(A) \( L_1 \cup L_2 \)
(B) \( L_1 \cap L_2 \)
(C) \( L_1 - L_2 \)
(D) \( L_2 - L_1 \)
Choose the correct answer from the options given below:
Suppose a minimum spanning tree is to be generated for a graph whose edge weights are given below. Identify the graph which represents a valid minimum spanning tree?
\[\begin{array}{|c|c|}\hline \text{Edges through Vertex points} & \text{Weight of the corresponding Edge} \\ \hline (1,2) & 11 \\ \hline (3,6) & 14 \\ \hline (4,6) & 21 \\ \hline (2,6) & 24 \\ \hline (1,4) & 31 \\ \hline (3,5) & 36 \\ \hline \end{array}\]
Choose the correct answer from the options given below: