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 22 =2*2, 24 =(22 )*(22 ), 28 =(24 )*(24 ). what will be the complexity of this efficient algorithm?