In the class GraphAlgorithm, insert java code for the method prim. Becuase of the MSTmain provide Dijkstra total equals 11. If your code is correct then Prim total should be equal to 9.

public class MyGraph {

 public static final int MAXSIZE = 100; public static final double BIGM = 10000000; public MyGraph(int size) { n = size; nodeStart = new Edge[MAXSIZE]; for (int i=0; i 
  public class Edge [{ public Edge(int i, int j, double c) { orig i; dest = j; cost C; public int orig; public int dest; public double cost; public Edge next null<>