Match the following Question:
| List I | List II |
| A. Insertion sort | I. T(n) = 2T(n/2) + O(n) |
| B. Heap sort | II. T(n) = T(n/2) + k |
| C. Merge sort | III. T(n) = T(n − 1) + log2(n) |
| D. Binary search | IV. T(n) = T(n-1) + n |
1
A - IV, B - III, C - I, D - II
2
A - I, B - III, C - IV, D - II
3
A - IV, B - II, C - I, D - III
4
A - IV, B - III, C - II, D - I