6 d 5 3 3 h 3 a a 2. 3 2. 4 4 1 c 5 2 g e Figure 1 Question 5 (20 points) 1) From the weighted graph G (as in Figure 1), apply the Prim Algorithm to find and compute the smallest spanning tree T in G. (10 marks) 2) Writing a programing in C/C++ to implement this algorithm. (10 marks)