Consider the problem of computing the product of integers. That is, given an input A = a,, a,, a) a sequence of integers, your algorithm must output m = a¸ · a¸ · ...· a = II a i=1 a. Write pseudocode...

Refer to image

please make pseudo code in Java

Extracted text: Consider the problem of computing the product of integers. That is, given an input A = a,, a,, a) a sequence of integers, your algorithm must output m = a¸ · a¸ · ...· a = II a 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.