Match the following:
| List I | List II |
| 1. Dijkstra's algorithm | i. Backtracking |
| 2. Merge sort | ii. Dynamic programming |
| 3. Traveling Salesman Problem (approximate) | iii. Greedy algorithm |
| 4. N-Queens Problem | iv. Divide and conquer |
1
1 - iv, 2 - i, 3 - ii, 4 - iii
2
1 - iii, 2 - iv, 3 - iii, 4 - i
3
1 - ii, 2 - i, 3 - iv, 4 - iii
4
1 - iv, 2 - iii, 3 - ii, 4 - i
5
Question Not Attempted