Q$4)(15$p$)$ Step throug hKruskal's algorithm to find a minimum spanning tree of the following graph. Show your steps in the table below. $($If you need to select two edges with the same weight, select the edge that would come alphabetically first$)$