Match the following with respect to algorithm paradigms :
$\begin{array}{clcl} & \textbf{List-I} & {} & \textbf{List-II} \\ \text{(a)} & \text{The 8-Queen's problem} & \text{(i)} & \text{Dynamic programming} \\ \text{(b)} & \text{Single-Source shortest paths} & \text{(ii)} & \text{Divide and Conquer} \\ \text{(c)} & \text{STRASSEN's Matrix multiplication} & \text{(iii)} & \text{Greedy approach} \\ \text{(d)}& \text{Optimal Binary search trees} & \text{(iv)} & \text{Back tracking} \\ \end{array}$
$\textbf{Code :}$
- $\text{(a)-(iv), (b)-(i), (c)-(iii), (d)-(ii)}$
- $\text{(a)-(iv), (b)-(iii), (c)-(i), (d)-(ii)}$
- $\text{(a)-(iii), (b)-(iv), (c)-(ii), (d)-(i)}$
- $\text{(a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)}$