The function PowerRecursive below takes inputs r and n, where r is any real number and n is a non-negative integer. The output is r". PowerRecursive (r, n) If (n = 0), Return (1) y := PowerRecursive...

see attachjed thank you

Extracted text: The function PowerRecursive below takes inputs r and n, where r is any real number and n is a non-negative integer. The output is r". PowerRecursive (r, n) If (n = 0), Return (1) y := PowerRecursive (r, n-1) Return (ry) The number of atomic operations performed by PowerRecursive does not depend on the value of r. The function T(n) is the number of atomic operations performed by the PowerRecursive on input n. The question below derives the recurrence relation for the time complexity of the algorithm PowerRecursive. What is the number of atomic operations performed by the recursive call in PowerRecursive? O (n-1) O T (n) O T (r-1) O T (n+1) Our