Adhere to style in PEP 8

Contain docstrings explaining purposes of lines

Outline has been given below

from __future__ import annotations

def bears(n: int) -> bool:

pass # TODO: implement me and remove this line of code

3.1 Specification This question involves a game with teddy bears. The game starts when I give you some bears. You can then repeatedly give back some bears, but you must follow these rules (where n is the number of bears that you currently have): 1. If n is even, then you may give back n/2 bears. 2. If n is divisible by 3 or 4 , then you may multiply the last two digits of n together and give back this many bears. 3. If n is divisible by 5 , then you may give back 42 bears. The goal of the game is to end up with EXACTLY 42 bears. For example, suppose that you start with 250 bears. Then you could make these moves: - Start with 250 bears. - Since 250 is divisible by 5 , you may return 42 of the bears, leaving you with 208 bears. - Since 208 is even, you may return half of the bears, leaving you with 104 bears. - Since 104 is even, you may return half of the bears, leaving you with 52 bears. - Since 52 is divisible by 4 , you may multiply the last two digits (resulting in 52=10 ) and return these 10 bears. This leaves you with 42 bears. - 42 bears is the goal! So, we succeeded! Note that at several of the steps, we had several options for how to proceed; not all of them would have resulted in success. In a file named bears.py, write a recursive function named bears to the following specification: Although this problem may seem silly at first, it's an example of a reachability problem, which is a problem that arises in many areas of computer science. Is it possible to reach a desired outcome from a given starting point. 3.2 Examples Some examples