2. . (a) Use selection algorithm to find the second smallest (k=2) of [5, 7, 4, 15, 9, 8, 13] Show how the partition alg
Posted: Sat May 14, 2022 3:07 pm
2. . (a) Use selection algorithm to find the second smallest (k=2) of [5, 7, 4, 15, 9, 8, 13] Show how the partition algorithm is applied in the selection algorithm. (10 marks) (b) For the following binary tree using pre-order, post-order, and in- order respectively, list the traversal order of the nodes. a b d f (6 marks) (c) Represent the following graph in matrix form and adjacency list respectively. 3 a 4. 9 5 20 b d 7