8. (2 points) What is the big-O of the following power() function? (Hint: it is in terms of the exponent's value) (Lipshutz?) int power (int x, int exponent) { if (exponent == 0) return 1; if (exponent return x; == 1) if (exponent mod 2 return power (x * return x else } == 0) // exponent is even x, exponent / 2); * * power (x , exponent / 2);