Implement prims algorithm in Java

Generate hundred random inputs of size 10 for your code. Do the same thing for size 20, 30, ... .

Run your prim algorithm on each set and count the average number of steps for each set and plot them. Try to do the same thing but this time calculate the average running time.

implement it in the following class

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 tge 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 } }