The function superpower receives two inputs, x and n, and should return xn-2 . x is a real number and n is a positive integer. superpower (x, n) if n = 1, then return (x^2) y : = superpower (x, n-1) return( ? ) the correctness of algorithm super power (x, n) is proven by induction on n. what would be proven in the base case?
a. super power (1, n) returns 1
b. super power (0, n) returns 0
c. super power (x, 0) returns x-2
d. superpower (x, 1) returns x2