Whаt is the оrder thаt edges аre added when using Prim's algоrithm tо find the minimum spanning tree for this directed and weighted graph (Graph is the same as the last question). Start with vertex F. Type each selected edge as per the order in each box, e.g. CD Selected Edge 1 : [1] Selected Edge 2 : [2] Selected Edge 3 : [3] Selected Edge 4 : [4] Selected Edge 5 : [5] Selected Edge 6 : [6] Selected Edge 7 : [7] Selected Edge 8 : [8] Vertex: A: , , B: , , , C: , , , , , D: , , , E: , , F: , , , , G: , , H: , , I: , ,