12. Converting recursive algorithms to iterative algorithms (6 points) If you understand how the above recursive algorithm to compute y works, you can turn it into a more efficient iterative algorithm that basically uses the same strategy (though it is not a tail recursive algorithm). Some parts of this iterative algorithm is given below. Fill in the blanks: Power-iteratively: number; z: non-negative integer) 1. answer=1 2. while z > 0 if z is odd then answer=- ZE y = 6. return