In this project, you will design and implement a game in which we have dragons and treasure in a

diamond shaped cavern $($game area$).$ The size of the game area is fixed. You will have a game area as

follows:

In the game area, you will have the following characters, items and rules;

$$ Place $5$ dragons on random locations in the game area

$$ Place treasure piles on locations where both x and y are odd

$$ Place $3$ traps on random locations $($make sure that you do not place both dragon and trap on the

same location$)$

$$ Place two exits on random locations in the game area: one exit opens to the escape route, the

other opens to cliff.

$$ Only gray cells are locations that the player is allowed to move into.

The player can move in any direction $($user inputs for moving are w: up$,$ s: down, a: right, d: left$)$

depending on the player$$s current position. For example, if the player is at location $(4,1),$ he$/$she can

move to the right but not move to the left, down and up$.$ At the beginning of the game, the player has no

treasure. When the player visits a location having a treasure, his$/$her treasure amount increases if he$/$she

can correctly guess $4-$digit number randomly generated number. When the player visits a location having

a dragon, he$/$she bribes the dragon with a portion of their treasure. The amount of treasure used for

bribe will be determined randomly. If the player has enough treasure for bribing the dragon, he$/$she

gains some game points; otherwise, he$/$she loses some game points. When the player visits a location

having a trap, he$/$she loses some of his$/$her treasure. You can determine the number of points to

lose$/$gain and the amount of treasure to lose by yourself. The game finishes when the player enters one

of the exits. If he$/$she enters the $$Escape Exit$,$ print his$/$her total game points. If he$/$she enters the $$Cliff

Exit$,$ he$/$she will lose all treasure and lose the game. After each move as the output, print the current

location of the player, the current amount of treasure, the number of dragons visited since the beginning

of the game, total game points, etc. At the end of the game, print the game area showing dragons, traps,

treasure, exits, etc.

Your solution must be modular since you must define sub$-$tasks and implement methods. You have to

write the following basic methods in your program and use them. You must also write other methods

that you design.

$-$ isDragon $($int x$1,$ int y$1,$ int x$2,$ int y$2,$ int x$3,$ int y$3,$ int x$4,$ int y$4,$ int x$5,$ int y$5,$ int x$\_$player, int y$\_$player$)$

that gets all the dragons$$ location and the player$$s location and returns true if there is a dragon at the

player$$s location.

$-$ isTrap$($int x$1,$ int y$1,$ int x$2,$ int y$2,$ int x$3,$ int y$3,$ int x$\_$player, int y$\_$player$)$ that gets the trap locations

and player$$s location and returns true if there is a trap at the player$$s location.

$-$ isTreasure$($int x$\_$player, int y$\_$player$)$ that gets the player$$s location and returns true if there are some

treasure at the player$$s location.

$-$ isEscapeExit$($int x$,$ int y$,$ int x$\_$player, int y$\_$player$)$ that gets the location of the Escape Exit and the

player$$s location and returns true if the player is at the Escape Exit.

$-$ isCliffExit$($int x$,$ int y$,$ int x$\_$player, int y$\_$player$)$ that gets the location of the Cliff Exit and the player$$s

location and returns true if the player is at the Cliff Exit.

$-$ canMove$($int x$\_$player, int y$\_$player, char direction$)$ that gets the location of the player and the direction

he$/$she wants to go and returns true if it is possible to go in that direction $($if there is a cell in that

direction on the game area$)$; otherwise returns false.

$-$ generate$4$DigitNum $()$ that generates a $4-$digit positive integer and asks the player to guess this

number, gets the answer, checks the answer and return true if the answer is true; otherwise, false.