In this assignment you will be implementing the O(n^2) version of Prim's algorithm, using the algorithm presented in class.
The input to your program is the cost matrix for a complete graph. The output is the list of edges of a minimum spanning tree, where each edge is identified by its end points, and the total cost of the minimum spanning tree. Your program should read from the input file data5.txt and write to output file, output5.txt. You will need to include an appropriate readme file, and follow the best practices for writing your code.
Example input
0 2 3
2 0 5
3 5 0
Example output
The minimum spanning tree has total cost 5 and whose edges are
(1,2), (1,3)
Please follow all instructions for Assignment 1 for submission of your files via canvas (note that the programs must run on CSE machines). Your program should be written in C or C++.