Please label egdge on the drawing like 1,2,3 use prim's algorithm

Problem 1: Use Prims Algorithm starting at vertex v (near the bottom left of the graph) to find the minimal cost spanning tree. Be certain to start at the listed vertex and to number the edges in the order that the algorithm tells you to select them 45 30 50 60 15 35 10 1 20 40 15 15 30 35 25 25 45 40 10 20 45 411 35