I need with this question, pls

For the C++ function fun below, give the tightest asymptotic upper bound that you can determine for the function's runtime, in terms of the input parameter, n. Also compute the return value of the function. Assume n>2, and that n is a perfect square. In your answers, you may assume that log n is base 2. Finally, our symbolic expression parser likes simplified logs, so, for example, rather than writing log(3 * n), you should write log(3) + log(n). * S = S - int coffee(int n) { int s = n n; for (int q = 0; a 0; 9--) s = 5 - 9; return s + 2; } int mocha(int n) { int r = 0; for (int i=0; i