3. Consider the problem of computing the product of integers. That is, given an input = Aa, a a) a sequence of integers, your algorithm must output m = aa a n == n II a (0.5 point each) i=1 a. Write pseudocode for an algorithm that solves the product problem using a loop. b. Identify the loop invariant in your algorithm that will help you prove your algorithm is correct. c. Using induction, prove that your loop invariant holds for each iteration.