Starting with vertex F, what is the order in which edges are selected when using Prim's algorithm to find the minimum spanning tree for this graph? Enter one edge in each box based on the order of selection using Prim's. e.g. FD in box 1, GD in box 2 and so on. 1. 2. 3. 4. 5. 6. 7. 8