Find an exact closed-form formula for M(n), the worst-case number of multiplications performed by the following function on input n, when n is a power of 5:

 int p3(unsigned n) { if (n == 1) return 1*2*3; return p3(n/5) * p3(n/5) * 4 * 5; }