Java. Perform Prim' and Kruskal's algorithms on the following graph modified this way: Change

current weights presented on the graph to $1093859.$

For example, if the first digit is $1,$ the weight between vertices $0$ and $1$ is $1,$ if the second digit of

your $0,$ the weight between vertices $0$ and $3$ is $0,$ If the third digit is $9,$ the weight on edge

between vertices $0$ and $4$ is $9,$ if the fourth digit is $3$ the weight on edge between vertices $1$ and $2$

is $3,$ etc.

Submission:

a$.$ Draw graph twice as described in the assignment, state which graph is created for what

algorithm.

b$.$ State the Source vertex for Prim's algorithm $($pick up vertex $0)$ and display initial distance

from source to each vertex that can be added to the MST$,$ explain which vertex was added and

why.

c$.$ Draw a tree for the Prim algorithm and Kruskal algorithm $($include only edges you included in

the tree$)$ and state the final cost of the MST $($the minimum total cost$).$