Match the pairs in the following questions:$$\begin{array}{|ll|ll|}\hline (a)…

Match the pairs in the following questions:$$\begin{array}{|ll|ll|}\hline (a) & \text{Strassen's matrix multiplication algorithm} & (p) & \text{Greedy method} \\\hline  (b) & \text{Kruskal's minimum spanning tree algorithm} & (q) & \text{Dynamic programming} \\\hline   (c) & \text{Biconnected components algorithm} & (r)  & \text{Divide and Conquer} \\\hline (d) & \text{Floyd's shortest path algorithm} & (s)  &\text{Depth-first search}  \\\hline \end{array}$$