In this assignment you will create a C++ program that implements both Kruskal’s Algorithm (pg. 704 of the textbook) and Prim’s Algorithm (pg. 707 of the textbook) to find a minimum spanning tree for a...

In this assignment you will create a C++ program that implements both Kruskal’s Algorithm (pg. 704 of the textbook) and Prim’s Algorithm (pg. 707 of the textbook) to find a minimum spanning tree for a simple, undirected, weighted graph. The input to the program will be a weighted adjacency matrix, which is described below. The output from the program will be two weighted adjacency matrices: 1. The weighted adjacency matrix for the minimum spanning tree produced by Kruskal’s Algorithm 2. The weighted adjacency matrix for the minimum spanning tree produced by Prim’s Algorithm You do not need to check for bad user input - you may assume the user always enters a correct weighted adjacency matrix for a simple, undirected, weighted graph.