Answer Happy

Suppose we have the graph below. 4 M 6 U 0 3 7 2 1 9 A 3 T 9 6 L 5 4 E 5 S Assume ties are broken alphabetically for both vertices and edges. Vertices are ordered alphabetically by label. Edges are ordered alphabetically by label pair (an edge between vertex U and vertex T is denoted TU). For instance, if AZ and EH have equal weight, AZ would be chosen before EH. Similarly, if we were choosing between AE and AZ we would pick AE because E comes in the alphabet before Z. Q2.1 Dijkstra's 0.2 Points Run Dijkstra's algorithm from L. What is the order that vertices are visited? Format your answer as a space separated list, e.g. ULTIMAS E. Enter your answer here Save Answer Q2.2 Prim's 0.2 Points Run Prim's algorithm from L. What is the order that vertices are visited? Format your answer as a space separated list, e.g. ULTIMAS E. Enter your answer here Save Answer Q2.3 Kruskal's 0.2 Points Run Kruskal's algorithm. What is the order that edges are added to the MST? Write edges in alphabetical order, e.g. Az and not ZA. Format your answer as a space separated list, e.g. IM AM AT ET ST. Enter your answer here Save Answer