(a) Use the 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. (b) Given a graph G(V,E), explain how the Prim minimum spanning tree (MST) algorithm can be applied to Construct an MST. For the following graph, show the cost of each stage, final cost, and sketch the final tree of Prim MST, starting from vertex 'a'. 5 a b 4 3 10 7 8 9 f 13 2 e