The function SuperPower receives two inputs, $x$ and $n,$ and should return $x^{4n-2}*x$ is a real

number and $n$ is positive integer.

The correctness of algorithm SuperPower $(x,n)$ is proven by induction on $n.$ What would be

proven in the base case?

SuperPower $(0,n)$ returns $0$

SuperPower$(1,$ n$)$ returns $1$

SuperPower $(x,0)$ returns $x^{-2}$

SuperPower$($x$,1)$ returns $x^2$