#3. Draw minimal spanning tree for the graph below using Kruskal's or Prim's algorithm. Please mark edges added to MST in bold red Note: I give it to you below - copy as many times as necessary and twist to put on top ofgraph drawing to show the complete MST Edges are added to MST by Kruskal's in the following order, for first 5 edges (keep lexicographical order) 1)2)3) 4) 5) Edges are added to MST by Prim's in the following order, for first 5 e (keep lexicographical order) 6 2 1)2)3) 4) 5) 6 - By how much the weight of edge (k,1) should be decreased so that this edge will be added into MST? At least by Out of MST will go the edge 5 By how much the weight of edge (e,f) should be increased to push this edge out of MST? At least by Inside of MST will go the edge