Last assignment, we had a function able to calculate the power by multiplying every time the base, which leads to the following oz function: declare fun power n m) if m-= 0 then 1 else n power n m-1) end end for example, (power 2 8) returns 256 after 8 recursive calls.
the complexity of this function is o(m), since there are m recursive calls, each responsible for one multiplication operation.

write a more efficient version of power, by reusing the intermediate results.

for example, the previous computation may be done using only 3 multiplications, namely 2-22, 2-(2) (2), 2(2 (2)

what will be the complexity of this efficient algorithm?