Which of the following algorithms constructs a minimum spanning tree on a graph by "jumping" around the graph, placing edges between nodes in ascending order of edge cost? Reverse-Delete algorithm Huffman's algorithm Kruskal's algorithm Prim's algorithm Question 2 Which of the following algorithms constructs a minimum spanning tree on a graph by starting at a root node and "growing" the tree outwards from the root, adding edges in ascending order of edge cost? Reverse-Delete algorithm Prim's algorithm Huffman's algorithm Kruskal's algorithm Question 3 Which of the following algorithms constructs a minimum spanning tree on a graph by starting with a full graph, and deleting edges in descending order of edge cost? Reverse-Delete algorithm Kruskal's algorithm Huffman's algorithm Prim's algorithm