Give the list of edges in the minimum spanning tree in the order that Kruskal's algorithm inserts them, and give the list of edges in the minimum spanning tree in the order that Prim's Algorithm inserts them, assuming it starts at vertex F. In Java

(20 points) Consider the following undirected weighted graph. 34 36 24 35 25 39 19 23 12 21 33 30 (a) Give the list of edges in the minimum spanning tree in the order that Kruskal's algorithm inserts them. Please implement the Kruskal's algorithm. Include screenshots of the program running and submit your java code in a separate file. (b) Give the list of edges in the minimum spanning tree in the order that Prim's algorithm inserts them, assuming that it starts at vertex F. Please implement the Prim's algorithm. Include screenshots of the program running and submit your java code in a separate file