$13\mathrm{.}12$ PA$4$ Q$2$: Fight!

Now we want a way to make our monsters fight!

Before two monsters can fight, we need to give $2$ new class methods that update their stats. Implement a method for "win$\_$fight" and "lose$\_$fight". Win$\_$fight should add $5$ to the monster's self.exp and reset their hp to max$\_$hp$.$ "lose$\_$fight" should also reset their hp but only adds $1$ exp to self.exp.

Now write a function that takes $2$ instances of the monster class and makes them fight. This function should be defined outside the Monster class, i$.$e$.$ it is not a Monster method. A fight goes as follows:

The monster that entered as the first function goes first.

Each monster takes a turn using one attack move. The monster selects this attack move from the strongest to the weakest in a circular function.

For example:

A monster has a dictionary of possible attack as follows:

$["$fire$\_$storm": $3,$ "double$\_$hit": $4,$ "earthquake": $2,$ "ice$\_$storm": $3]$

Monster will select the following attacks:

$\backslash$table$[[$Round No$,$Move,$],[1,$double$\_$hit,Highest hit points$],[2,$fire$\_$storm,Same hit points as ice$\_$storm but comes first alphabetically$],[3,$ice$\_$storm,$],[4,$earthquake,$],[5,$double$\_$hit,$],[6,$fire$\_$storm,$],[7,$ice$\_$storm,$]]$

And so on$.$

$3.$ An attack is always successful and will decrease the opponent's hp by the given number of points in self attacks dictionary. The monsters continue taking turns until their current $hp$ becomes less than or equal to zero.

$4.$ At this point, the win$\_$fight and lose$\_$fight method should be invoked. Once this complete, return $3$ things from the function.

Round$\_$number

Monster that won $($return the corresponding Monster object$)$

List of attacks the monster used

Special Edge Case: If both monster only have "wait" as an attack, return

$-1($round$\_$number$)$

None $($for monster name that won$)$

None $($for list of attack that monster use$)$