IV. Questions and answers (25 points) (1) Draw the Binary tree from a Array-based storage as the following picture. (10 points) 1 2 3 4 5 6 7 8 9 10 11 ABEC AGED A (2)For the following graph, compute the minimum spanning tree. Give all the steps. (15 points) (u, v, weight) (0,3,5) (0, 1, 50) (0, 2, 45) (1.2, 10) (2, 3, 12) (4. 1. 20) (3, 4, 15) (2, 4, 30) V. Program design (15 points) (1) Write a CH function to compute the number of two-degree nodes of a given binary tree. (15 points) For example: struct BiTnode int data: BiTnode * leftChild; BiTnode "rightChild; int NumOfTwoDegree(BiTnode* root) // Add your code. return num; 3