Develop a Java program to find the minimum spanning tree $($MST$)$ using Prim's Algorithm. Consider file I$/$O$.$ The $2$D adjacency matrix $($where nonzero values are the weights of the corresponding edges$)$ will be taken from a file. In each row, the values are space separated. The output will be shown on the screen as an adjacency matrix.$$

The maximum number of nodes to be handled is $10.$

Sample Input $($for a graph with $6$ nodes$).$ Inputs will be taken from a file:$$

$040008$

$4070011$

$070230$

$002067$

$003601$

$8110710$

Sample Output $($will be displayed on screen$)$:$$

$040000$

$407000$

$070230$

$002000$

$003001$

$000010$