We need help with homework

Plz explain for the step

What's the best case, worst case, and average case runtime of pow? Assume n = power. Please remember to define n, provide a tight upper bound What one-line change could you make to improve the worst case? Describe the change. You must provide a written explanation of why your change works in order to receive full credit. algorithm pow Input: positive integer b, non-negative integer p Output: computing b^p (i.e. b raised to power of p) if p = 0 return 1 else if p = 1 return b else if p is even temp = pow(b, p/2) return temp * temp else return b*b* pow(b, p-2)