7 . Consider the following functional pseudo - code for computing powers. b 0 bn + 1 = bn times b ( a )

Question

59 users unlocked this solution today!

$7.$ Consider the following functional pseudo$-$code for computing powers. b$0$bn$+1=$ bn $\backslash$times b$($a$)$ Transform the functional pseudo$-$code by adding an accumulation parameter and making it tail recursive. It should continue to have the form of functional pseudo$-$code. However, at this point it is natural to switch from infix notation to prefix and write f$($b$,$n;a$).($b$)$ Transformthe tail$-$recursive functional pseudo$-$code into imperative $($but still recursive$)$ pseudo$-$code.$($c$)$ Transform the $($tail$-$recursive$)$ imperative pseudo$-$code into iterative$6$ pseudo$-$code that has no recursive calls.