Assume n %2 ==0 and array A is previously declared and initialized properly with integer values. Also, array indexes range from 0 to n-1. I. A[0] to A[j], for every j in range [0, n/2-1]
II. A[n-j] contains the partial sum of A[n-1] to A[n-j], for every j in range [1, n/2]
III. res contains the sum of the original values of A[n/2-1] and A[n/2]
IV. res contains the sum of all numbers in A
V. The algorithm runs in O(n):

For j= 1 to n/2=1
A[j]= A[j] + A[j-1]
For j=2 n/2
A[n-j]= A[n-j] + A[n-j+1]
res= A[n/2 -1] + A[n/2]

a. III and V only
b. I, II, IV and V only
c. l, Il, IV only
d. l, Il, III only
e. l, II, III, V only