• Design/Analysis of Algorithms
• please do NOT post CODE
• 
• please show all work and show steps

Question #3 (17 points) Consider the following code fragment: 1 Do-Math(x, p) result 1 factor = x pLeft = p while pLeft > 0 result = result factor pLeft = pleft-1 return result Provide clear, concise answers to each of the following related questions. (2 points). What does Do-Math(2,4) return? 2 . (12 points). Prove the following loop invariant for Do-Math(): (pLeft> 0) and (result * factorpleft = IP). Be sure to argue both the initializa- tion and maintenance conditions. (3 points). Using the invariant, prove the correctness of Do-Math(). Rely on the invariant and the one other fact guaranteed to be true upon loop termination