(a) Show that the number of vertices in a binary tree is odd. Also calculate the forinula for the number of pendant vertices in a binary tree. (b) i. Find the minimal spanning tree in the graph shown in Figure 4, where the weight of the each edge is also given in the graph. ii. Find all the fundainental cut sets corresponding to the ininimal spanning tree. iii. Express the cut set {e, f, k, l} as ring sum of the fundamental cut sets obtained in part (ii) above. b.4 e.6 h.8 d.3 9.7 i2 1,8 k.5 Figure-4