Let n be the size of an array A. Following the induction steps below, some students have designed the algorithms shown below, which of the following statement is correct assessment of the algorithms designed: Induction Process Basis Step: We compute the product of an array of one number by setting it to the number. Inductive Step: Induction Hypothesis: We know how to compute the product of the numbers in an array of (n-1) numbers. Using the induction hypothesis, for computing the product of the numbers in an array of n number, first, we compute the product of the first (n-1) numbers in the array, and we multiply t > Algorithm 1: Prodi(A, n) { if n = 1 prod = A[0] else prod = A[n-1] X Prodi (A, n-1) return prod Algorithm 2: Prod2(A, 1, r) { if lor return A[1] else return (prod(A, 1, (1 + r)/2/)) x prod(A, (1 + r)/2 + 1,r)) } 3 Algorithm 3: Prodcut 3(A, n) { if n=1 prod = A[@] return prod else { m = n/2 prodi = A[@] for i = 1 to (m-1) prodl = prod1 x A[i] prod2 = A[m] for i = (m+1) to (n-1) prod2 = prod2 X A[i] return prodl X prod2 } > Select one: O a. Only Algorithm 3 is designed from the induction process correctly. O b. Only Algorithm 1 is designed from the induction process correctly. Oc. Both Algorithm 1 and Algorithm2 are designed from the induction process correctly. O d. Only Algorithm 2 is designed from the induction process correctly. oduct of the numbers in an array of (n-1) numbers. roduct of the numbers in an array of n number, first, we compute the product of the first (n-1) numbers in the array, and we multiply this product to the last number to get the required product