please help

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 n>2, that n is a power of 2, and that log(n) is base 2. Finally, our symbolic expression parser likes simplified logs, so, for example, rather than writing log(3n), you should write log(3)+log(n). int fun(int n ) int r=0; for (inti=1;i