An alternative strategy for the expo function uses the following recursive definition: expo (number, exponent) =1, when exponent = 0 = number * expo(number, exponent - 1), when exponent is odd = (expo (number, exponent//2))2 , when exponent is even Does this strategy reduce the computational complexity? Explain. You may use Big-O notation concept.