10. (3 points) Assume that you are going to solve the MST (Minimum Spanning Tree) problem using the Prim's algorithm for the following graph. Draw the final MST. For the problem, you have to start from the vertex a. You must also provide the sequence of vertices to be added to the "visited" set as we covered in the class 3 9 5 10