The correct matching for the following pairs is
$$\begin{array}{l|l}\hline \text{A. All pairs shortest path} & \text{1. Greedy } \\\hline \text{B. Quick Sort} & \text{2. Depth-First Search} \\\hline \text{C. Minimum weight spanning tree} & \text{3. Dynamic Programming} \\\hline \text{D. Connected Components} & \text{4. Divide and Conquer} \\\hline \end{array}$$
$\text{A-2 B-4 C-1 D-3}$
$\text{A-3 B-4 C-1 D-2}$
$\text{A-3 B-4 C-2 D-1}$
$\text{A-4 B-1 C-2 D-3}$
Reference : Read the Intro/Algo Sub-Heading.