Use Prim's Algorithm to find a minimum spanning tree for the following graph. Show the values in nearest, distance, and F for each step. 1 23 4 5 6 0 1030 45 oo 0 50 o 40 25 50 0 35 15 30 oo o 0 20 2 10 4 5 | 45 40 35 0 55 6 25 15 20 55 0