2. (10 pts.) Find an exact closed-form formula for M (n), the worst-case number of multiplications performed by the following function on input n. This includes writing the recurrence relation and solving the recurrence. procedure P(int n) { if n == 1 then return 2 * n * (n-1) for i=1 to n do temp = temp * i return temp * P(n/5) * P(n/5) * P(n/5) }