Problem 2. (8 points) Suppose there are n circles which intersect each other at exactly 2 points. Prove by induction that they create n? - n +2 regions for all n 1. Do not use any complex built-in functions such as log. What is the time and space complexity of your algorithm nising RAM uniform cost model ? Problem 4. (20 points) Order the following functions according to the relation: f(n)