Please help me solve this question with show the working.

For the C++ function 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 that the input parameter n > 2. int fun(int n) { int r; int 5 = 0; for (int q = 1; q 2; P--) return r * s; 1. Worst case asymptotic running time is: E') of symbolic expression 9 2. An exact expression for the return value is: fun(n) = symbolic expression 9