Find a closed-form formula for M(n), the worst-case number of *'s performed by the algorithm below on input n, when n is a power of 3: int p2 (int n) { } if (n == 1) return 1*2*3*4; return p2 (n/3)* p2(n/3) * p2 (n/3);