Question 3: Matches in the box For this problem you need to use Mutual Recursion. If you are not sure how to use it, please refer to section 1.7.2 of our textbook This games is two-player game. There are m matches in a box. The players take turns and can remove either one or two matches. The player who takes the last match wins. Your two friends decided to stick to a certain strategy: 1) Steve always removes a single match, unless there are exactly 2 matches remaining, in which case he takes 2. 2) Kate removes one match if an odd number of matches is in the box, and two matches otherwise Assume that there are m matches and the player function called goes first, who wins the game? Output: You are expected to return one of the following strings, verbatim: . "Steve wins the game . Kate wins the game def steve (n) : >>> steve (1) "Steve wins the game >>> steve (5) "Steve wins the game" # YOUR CODE GOES HERE # def kate (n): >>> kate (1) "Kate wins the game >>> kate (2) "Kate wins the game # YOUR CODE GOES HERE