Implement the class using prims algorithm

import java.util.ArrayList; public class PrimTestDrive { public static void main(String[] args) { ArrayList matrices = readInput(); for(int[][] matrix : matrices) { prim(matrix); } } private static ArrayList readInput() { return null; } /**  * This method accepts the adjacency matrix of the graph and prints out the output MST.  * 
  * Example of output is:  * (0,1), (1,2), (1,4), (2,5), (5,3)  * Where the numbers are indices of the vertices.  * 
  * @param matrix an n*n adjacency matrix of input graph  */  private static void prim(int[][] matrix) { // Complete this method } }