Write a Java, program that:

Implements Prims algorithm for finding the minimum spanning tree of a weighted graph. Your program should conform to the following specifications.

Prompt the user for the number of vertices in the graph.

Prompt the user to enter the adjacency matrix of the graph one row at a time.

Print the adjacency matrix of the graph.

Print the weight of the minimum spanning tree.

Print the list of edges in the minimum spanning tree.

Test the above program on the graph from problem #2

2. Use Prim's algorithm (Algorithm 4.1) to find a minimum spanni the following graph. Show the actions step by step. 32 01 17 45 18 10 28 25 59 4 12