(Solved) : Lab Description Create Grid Random Values Pass Array Values Randomly Load Values Grid Use Q37276118 . . .

Lab Description: Create a grid of random values. Pass in an array of values and randomly load the values into the grid. Use math random to load the values into the matrix. Search the grid to see how many of a certain value exist in the grid. Return the largest group found out of the specified search values. Sample Output: Files Needed: Grid.java GridRunner.java 9 x b7c79a92c9ba7x99 a c cx27c2bbcx9a777xxbxx 7)c 7 9 b a c a 2 2 7 9 x b 7 a c c c c bxa9ca 2929abc2 9 a b 9.9 29 xc7 cxbcbc7272 2 b 9×9 c97a 7axbaca 9 222xac7 9a222c99cb7b2cb c27aa cas77a7x bb 2 cb27x 722a с99xbbababa92bx2xx9b –debugging code to help aec if the aigorithn is working- -these printin statements can be added to the nax method– count is 70 b count is 60 c count is 61 7 count is 58 9 count is 43 x count is 58 2 count is 50 a occuzs the most. b 22x ca2b 9 7 b27x29c79x bc9x22x77 x occuzs the most. public class Grid private Stringl lI] grid; //load vals into the rows x cols grid randomly public Grid(int rows, int cols, String vals) //find out which of the vals occurs the most public String findMax (String[ vals) return “nothing yet”; //returns a count of how many times val occurs in the matrix private int countVals( String val ) return 0; //display the grid public String tostring() String output=””; return output; import java.io.File; import java.io. IOException; import java.util.Scanner; import static java.lang.System.*; public class GridRunner throws IOException public static void main( String args Show transcribed image text Lab Description: Create a grid of random values. Pass in an array of values and randomly load the values into the grid. Use math random to load the values into the matrix. Search the grid to see how many of a certain value exist in the grid. Return the largest group found out of the specified search values. Sample Output: Files Needed: Grid.java GridRunner.java 9 x b7c79a92c9ba7x99 a c cx27c2bbcx9a777xxbxx 7)c 7 9 b a c a 2 2 7 9 x b 7 a c c c c bxa9ca 2929abc2 9 a b 9.9 29 xc7 cxbcbc7272 2 b 9×9 c97a 7axbaca 9 222xac7 9a222c99cb7b2cb c27aa cas77a7x bb 2 cb27x 722a с99xbbababa92bx2xx9b –debugging code to help aec if the aigorithn is working- -these printin statements can be added to the nax method– count is 70 b count is 60 c count is 61 7 count is 58 9 count is 43 x count is 58 2 count is 50 a occuzs the most. b 22x ca2b 9 7 b27x29c79x bc9x22x77 x occuzs the most.
public class Grid private Stringl lI] grid; //load vals into the rows x cols grid randomly public Grid(int rows, int cols, String vals) //find out which of the vals occurs the most public String findMax (String[ vals) return “nothing yet”; //returns a count of how many times val occurs in the matrix private int countVals( String val ) return 0; //display the grid public String tostring() String output=””; return output;
import java.io.File; import java.io. IOException; import java.util.Scanner; import static java.lang.System.*; public class GridRunner throws IOException public static void main( String args