Assignment Objectives: (1) to practice Big-O Notation and (2) to practice writing a recursive function in Python.

1. If a recursive function did not have a base case, what would happen when it was called?

2. An algorithm performs (15n² + 50n + 125) operations for a problem size of n. This algorithm can be classified as: O ( ___ ).

3. An algorithm performs (20n + n/2 + 200) operations for a problem size of n. This algorithm can be classified as: O ( ___ ).