Question 5 Consider an integer array a of length n with indexing starting at 0, where n is a positive integer. If the elements of the array a are to be written out in reverse order, which of the following C++ code fragment does NOT do the job? Question 5 options: a. int i=n-1; while (i>=1){ cout =1){cout =0){cout 0){cout 1)? n* factorial(n-1): 1; } int factorial(int n){ return (n>1)? factorial(n)* factorial(n-1): 1; } e. Question 8 Consider the following program segment, where a is an integer constant and b is an integer variable that holds a positive value. int r= 0; int n = b; while (n !=0){rt= a; n--; } Which of the following is a loop invariant for the while loop? Question 8 options: a. r= a(b-1) b. r=b(a-1) r= a + b d. r= ab - 1 e. r= ab c