$4.$ The class TrackCarver has been implemented for you. This is the main class.

$5.$ The class TrackGenerator needs to be implemented by you. Specifically the following

methods need to be filled in:

$$ private static void fill$2$DArray$($ char$[][]$ wood$)(5$ points$)$

The purpose of this method is to fill the $2$ dimensional array with all one character

to represent a fresh piece of wood.

$$ public static void carveTrack$($char$[][]$ wood, int x$,$ int y$)(20$ points$)$

This method is the recursive method. wood should already be filled with the

character that you chose to fill it with in fill$2$DArray $($you don$$t need to call it$).$ x

and y is the location your algorithm is currently at$.$ At this point, your virtual

chisel has to check to see if it can move in any direction. Randomly $$chisel$$ in a

direction provided you can $($see above rules$).$ This means $$chiseling$$ through two

spots of the array by setting those cells to blank spaces and passing off this new

location to a recursive call of this method. When it can no longer make any moves

$($it has no neighbors$),$ the method simply returns.

To help with carveTrack, I have provided you with $5$ methods.

$1.$ hasWestNeighbor

$2.$ hasEastNeighbor

$3.$ hasNorthNeighbor

$4.$ hasSouthNeighbor

$5.$ hasNoNeighbors

You can use these methods to help you determine if there are neighbors and which

neighbors it has. Again, neighbors are defined as a place you can chisel to$,$ that will

not chisel into an already existing tunnel.

$5.$ Make sure you comment your program. This includes name, date, description, as well as

general comments in the above mentioned methods $($carveTrack and fill$2$DArray$).(5$

points$)$

$6.$ Test your program thoroughly with different size tracks. In TrackCarver.java, you will

see the call to printMatrix, if you replace the textfile name with an empty string $(),$ it

will print the track to the console. You can do this early on to quickly test your code. The

downside is$,$ after a certain size, the console will not accurately print out the track $($a

limitation of the console$).$ Once you are certain your track works, print out $3$ tracks of

different sizes, and complete them with a pen or marker to show the rats can complete it

$($get to the cheese from the beginning$).$ Alternatively, you are granted permission to have

a friend or family member complete the printed tracks for you. $($NOTE: your recursive

algorithm does not need to make the $$start$$ and $$end$$ points, you can manually choose

them when you go to print it$).$ Scan or take pictures of the completed tracks.

$---------------------------------$

import java.io$.$File;

import java.io$.$PrintWriter;

import java.util.Random;

public class TrackGenerator $\{$

private static Random rand $=$ new Random$()$;

private static void fill$2$DArray$($char $[][]$wood$)$

$\{$

$//$Fill the $2$D array 'wood' with non$-$space characters

$/*********************************************$

$*$ TODO FILL IN CODE HERE

$*********************************************/$

$\}$

private static void carveTrack$($char $[][]$ wood, int x$,$ int y$)$

$\{$

$/*********************************************$

$*$ TODO FILL IN CODE HERE

$*********************************************/$

$\}$

private static boolean hasWestNeighbor$($char$[][]$ wood, int x$,$ int y$)$

$\{$

return $($x$-2)>=1$ && wood$[$x$-2][$y$]!=\text{'}\text{'}$;

$\}$

private static boolean hasEastNeighbor$($char$[][]$ wood, int x$,$ int y$)$

$\{$

return $($x$+2)=1$ && wood$[$x$][$y$-2]!=\text{'}\text{'}$;

$\}$

private static boolean hasSouthNeighbor$($char$[][]$ wood, int x$,$ int y$)$

$\{$

return $($y$+2)$