Match the algorithms with their time complexities:
List-I (Algorithm)
(P) Towers of Hanoi with n disks
(Q) Binary search given n sorted numbers
(R) Heap sort given n numbers at the worst case
(S) Addition of two matrices
List-II (Time complexity)
(i)
(ii)
(iii)
(iv)
- AP - (iii), Q - (iv), R - (i), S - (ii)
- BP - (iv), Q - (iii), R - (i), S - (ii)
- CP - (iii), Q - (iv), R - (ii), S - (i)
- DP - (iv), Q - (iii), R - (ii), S - (i)

