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 number of tokens in the Fortran statement DO 10 I = 1.25 is

The number of full and half-adders required to add 16-bit numbers is:

Booth’s coding in $$8$$ bits for the decimal number –$$57$$ is: