6 d 5 3 4 a 4 1 5 e 2 g 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)