The number of articulation points of the following graph is

A sorting technique is called stable if:

If one uses straight two-way merge sort algorithm to sort the following elements in ascending order 20, 47, 15, 8, 9, 4, 40, 30, 12, 17 then the order of these elements after the second pass of the algorithm 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)