Consider the following table:
|
Algorithms |
Design Paradigms |
|
(P) Kruskal |
(i) Divide and Conquer |
|
(Q) Quicksort |
(ii) Greedy |
|
(R) Floyd-Warshall |
(iii) Dynamic Programming |
1
(P) ↔ (ii), (Q) ↔ (iii), (R) ↔ (i)
2
(P) ↔ (iii), (Q) ↔ (i), (R) ↔ (ii)
3
(P) ↔ (ii), (Q) ↔ (iv), (R) ↔ (i)
4
(P) ↔ (i), (Q) ↔ (ii), (R) ↔ (iii)
5
(P) ↔ (ii), (Q) ↔ (i), (R) ↔ (iii)