The elements 32, 15, 20, 30, 12, 25, 16, are inserted one by one in the given order into a max Heap. The resultant max Heap is

If T₁ = O(1), give the correct matching for the following pairs:

List - I

(M) T_n = T_{n - 1} + n
(N) T_n = T_n/2 + n
(O) T_n = T_n/2 + nlog n
(P) T_n = T_{n - 1} + log n

List - II

(U) T_n= O(n)
(V) T_n = O(nlogn)
(W) T_n = O(n²)
(X) T_n = O(log²n)

The minimum number of interchanges needed to convert the array

89, 19, 40, 17, 12, 10, 2, 5, 7, 11, 6, 9, 70

into a heap with the maximum element at the root is

The average number of key comparisons done on a successful sequential search in list of length n is