

Please show steps for the question 20 and 14.
Q. 20 Itone uses straight two way merge sort algorithm to cort the following elements in ascending order $20,47,15,8,9,4,40,30,12,17$
Then the order of these elements after second pass of the algorithm is
(3) $8,9,15,20,47,4,12,17,30,40$
(b) $8,15,20,47,4,9,30,40,12,17$
(c) $15,20,47,4,8,9,12,31,40,17$
(d) $4,8,9,15,20,47,12,17,30,40$
[GATE-1999]
the wornat case height of AVL tree with fingoes
11
(a) Rlad 1
(b) $n \log (n+1)$
ja) $184 \log (n+2)$
(d) 1.44 nlog n