break this question down and explain why the answer is this

V. Apply Kruskal'v Algorithm to the folbowing graph wo determitse a Minimum Spanning Tree (13) Kraskil's algorithm is en edge oricuted slgorithen SHOW YOUR WORK AS YOU APPLY KRUSKAL'S ALGORTHM. THAT IS, UST THE EDGES IN THE ORDER THAT THEY ARE ADDED TO THE TREE WHAT IS THE COST OF THEMINIMAL SPANNING TREE? 39 INDICATE BIL OW (DRA W) THE RESULTING MINIMAL, SPANNING TREE. TRACt: I.is below the edes of the gounh in the order in which they ntte nded Which they In the space below, draw the resulting MST OR