"import java.io$.$FileReader;

import java.io$.$BufferedReader;

public class Part$1\{$

private static int$[][]$ grid;

private static int n;

private static int m;

public static long getMax$($String fn$,$ int mVal$)\{$

loadGrid$($fn$)$;

m $=$ mVal;

$//$TO BE IMPLEMENTED

$\}$

private static void loadGrid$($String fn$)\{$

BufferedReader reader;

try $\{$

reader $=$ new BufferedReader$($new FileReader$($fn$))$;

String line $=$ reader.readLine$()$;

if$($line $!=$ null$)\{$

n $=$ Integer.parseInt$($line$)$;

grid $=$ new int$[$n$][$n$]$;

line $=$ reader.readLine$()$;

int r $=0$;

while$($line $!=$ null$)\{$

String$[]$ str $=$ line.split$("""")$;

if$($str$.$length $<$ n$)$

break;

for$($int c $=0$; c $<$ n; c$++)$

grid$[$r$][$c$]=$ Integer.parseInt$($str$[$c$])$;

r$++$;

line $=$ reader.readLine$()$;

$\}$

$\}$

$\}$catch $($Exception e$)\{$

e$.$printStackTrace$()$;

$\}$

$\}$

$\}$Part $1(25$ s$)$ Consider the grid below. $0123404581917891001287229915243439358$ The grid is of size $5*5.$ If we consider any set of $3$ integers in the grid $($horizontally$,$ vertically, or diagonally$),$ we find that the set w XI$11$ ith the highest product is $\{9,9,8\}$ with a product of $9$ x $9$ x $8=648.$ In this part of the project, you must implement a solution to the following problem. Given an N $*$ N grid of integers and an integer M