Projects that don$$t compile will receive a $0.$ You may use block comments if you have non$-$compiling sections of code. $$ Projects that only have a main method or only use one class will receive a $0.$ Projects that do not meet javadoc guidelines for classes & methods will receive a $0.$ If you use a paid solution site $($Chegg$,$ CourseHero, etc.$),$ you will receive an F in the course. $[15$ pts$]$ The game is initialized as described, with the hero, a valid catacomb size, and the correct number of monsters randomly placed in the catacomb per the catacomb size. $[15$ pts$]$ The hero can move between rooms and invalid moves are rejected. $[10$ pts$]$ The hero is correctly warned of the number of monsters in adjacent rooms. $[10$ pts$]$ Heroes & monsters lose health per requirements when fighting or moving. $[10$ pts$]$ Dead monsters are removed from the catacomb. $[10$ pts$]$ The program recognizes when the hero has died or has succeeded in escaping the catacomb. $[10$ pts$]$ Program is cleanly organized using methods & classes $[10$ pts$]$ Program uses javadoc standards & meaningful comments $[10$ pts$]$ README.md contains project documentation per outline in Project Documentation section $[20$ pts$]$ An additional game feature is implemented in your game. $$ Create a comment at the top of you driver class that describes the feature $$ Update the user manual in README.md to include the feature since it will change how the game is played. $20$ points $==2\%$ additional credit in the course.

Some rooms in the catacomb have gold in them, and the hero$$s goal is not only to survive but to accumulate as much gold as possible

Example Run What is your name, heroic adventurer? Bob How wide of a catacomb do you want to face $(5-10)?500$ That is not a valid catacomb size! How wide of a catacomb do you want to face $(5-10)?5$ Bob at $0,0$ with $100$ health You smell $0$ monsters nearby. Which way do you want to go $($north$,$ south, east, west$)?$ potato You can$$t move that way! Which way do you want to go $($north$,$ south, east, west$)?$ north You can$$t move that way! Which way do you want to go $($north$,$ south, east, west$)?$ east Bob at $0,1$ with $98$ health You smell $0$ monsters nearby. Which way do you want to go $($north$,$ south, east, west$)?$ south Bob at $1,1$ with $96$ health You smell $1$ monsters nearby. Which way do you want to go $($north$,$ south, east, west$)?$ south Bob at $2,1$ with $94$ health You smell $0$ monsters nearby. Which way do you want to go $($north$,$ south, east, west$)?$ east Bob at $2,2$ with $92$ health You smell $1$ monsters nearby. Which way do you want to go $($north$,$ south, east, west$)?$ east Bob at $2,3$ with $90$ health You smell $3$ monsters nearby. Which way do you want to go $($north$,$ south, east, west$)?$ south Bob at $3,3$ with $88$ health versus Monster $2$ at $3,3$ with $25$ health You hit for $1$ You get hit for $2$ You hit for $8$ You get hit for $5$ You hit for $7$ You get hit for $4$ You hit for $4$ You get hit for $1$ You hit for $3$ You get hit for $4$ You hit for $6$ Monster $2$ has been defeated! Bob at $3,3$ with $70$ health You smell $0$ monsters nearby. Which way do you want to go $($north$,$ south, east, west$)?$ north Bob at $2,3$ with $68$ health You smell $2$ monsters nearby. Which way do you want to go $($north$,$ south, east, west$)?$ south Bob at $3,3$ with $66$ health You smell $0$ monsters nearby. Which way do you want to go $($north$,$ south, east, west$)?$ east Bob at $3,4$ with $64$ health You smell $0$ monsters nearby. Which way do you want to go $($north$,$ south, east, west$)?$ south You have escaped the catacomb

Demonstrate object$-$oriented skills through appropriate use of classes and methods.

The user chooses the name of their hero and the size of the catacomb N$,$ where N is between $5$ and $10$ inclusive. The catacomb is an N$-$by$-$N square of rooms $($for example, if the user chooses $7,$ then the catacomb has $7$ rows with $7$ rooms in each row, for a total of $49$ rooms$).$ The hero character starts out with $100$ health in the room in the northwest corner of the catacomb. The goal of the game is for the hero to make it to the catacomb$$s exit in the southeastern room before they run out of health. There is one monster in the catacomb for every six rooms $($e$.$g$.,$ if there are $49$ rooms, there are $8$ monsters$).$ The monsters are named Monster $1,$ Monster $2,$ etc. and start out with $25$ health. Each monster$$s location in the catacomb should be determined randomly, but no monster can start out in the north$-$west corner, where the hero enters the catacomb.

If the hero moves into a room that has one or more monsters in it$,$ the hero fights each monster to the death, one at a time. The hero does between $1$ and $10$ hit points of damage $($randomly determined$)$ with each attack, and monsters do between $1$ and $5$ damage $($randomly determined$).$ The hero uses $2$ health points just by moving between rooms. If the hero dies during a fight, the game is over. If a monster dies, they should be removed from the collection of monsters so that they cannot attack the hero again and the hero can no longer smell them. have $300$ lines of code write in java