Match the pairs in the following:

List - I

(a) Heap construction
(b) Constructing hash table witn linear probing
(c) AVL Tree construction
(d) Digital tree construction

List - II

(p) $$\Omega \left( {n\log _{10}^n} \right)$$
(q) O(n)
(r) O(n²)
(s) $$\Omega \left( {n\log _2^n} \right)$$

Match the pairs in the following:

List - I

(a) Straseen's matrix multiplication algorithm
(b) Kruskal's minimum spanning tree algorithm
(c) Bioconnected components algorithm
(d) Floyd's shortest path algorithm

List - II

(p) Greedy method
(q) Dynamic programming
(r) Divide and Conquer
(s) Depth first search