Graphs and Trees $(5$ problems$)$

Consider the graph. Draw the table describing execution of

$(1)$ Kruskal's

$(2)$ Prim's algorithms for finding the minimal spanning tree.Graphs and Please give detailed solution to the problem, how you got the results and so on$.$ Explain also Kruskal Algorithm and Prim too

Create the tables for both of them more understandable, with explanations