Consider the following array:

Determine which partitioning scheme, Naive or Hoare's, was used to end

up with the provided resulting array based on the given pivot. Assume

Solve, in big-Θ, the following recurrence relation.

T(n) = T(n-4) + n*c, where n >= 4
T(n) = b,            where n < 4
for constants b and c.

Given the following pseudocode, derive the recurrence relation that describes its time complexity.

def power(x, n):
    if n == 0:
        return 1
    return x * power(x, n - 1)

Let b and c represent constant values. What are the base case and the recursive step?