Q6MCQ1 mark, −0.33Match the following: P.Prim’s algorithm for minimum spanning treei.BacktrackingQ.Floyd-Warshall algorithm for all pairs shortest pathii. Greedy methodR. Merge sort iii. Dynamic programmingS.Hamiltonian circuit iv. Divide and conquer\begin{array}{|ll|ll|}\hline \text{P.} & \text{Prim's algorithm for minimum spanning tree} & \text{i.} & \text{Backtracking} \\\hline \text{Q.} & \text{Floyd-Warshall algorithm for all pairs shortest path} & \text{ii.}& \text{ Greedy method} \\\hline \text{R.} & \text{ Merge sort } & \text{iii.} & \text{ Dynamic programming} \\\hline \text{S.}& \text{Hamiltonian circuit } & \text{iv.} & \text{ Divide and conquer} \\\hline \end{array}P.Q.R.S.Prim’s algorithm for minimum spanning treeFloyd-Warshall algorithm for all pairs shortest path Merge sort Hamiltonian circuit i.ii.iii.iv.Backtracking Greedy method Dynamic programming Divide and conquer(A)P-iii, Q-ii, R-iv, S-i\text{P-iii, Q-ii, R-iv, S-i}P-iii, Q-ii, R-iv, S-i(B)P-i, Q-ii, R-iv, S-iii\text{P-i, Q-ii, R-iv, S-iii}P-i, Q-ii, R-iv, S-iii(C)P-ii, Q-iii, R-iv, S-i\text{P-ii, Q-iii, R-iv, S-i}P-ii, Q-iii, R-iv, S-i(D)P-ii, Q-i, R-iii, S-iv\text{P-ii, Q-i, R-iii, S-iv}P-ii, Q-i, R-iii, S-ivSign in to save attempts.Show answer← PreviousNext →SolutionsDiscussionLoading…Sign in with Google