Let

x$1,$ x$2,...,$ xn

be an array. Consider the following algorithm.

for

i $\{1,2,...,$n$/2\}$

do$$

t $$ xi

$$

xi $$ xn $$ i $+1$

xn $$ i $+1$ t

$($a$)$ How many $""$ operations does this algorithm perform?

n$3$n$3$n$/23$n$/2$n$/2$

$($b$)$ What does this algorithm do to the array?

It shifts the first element to the end of the array and every other element one place to the left.It subtracts $1$ from each element of the array.$$ It shifts the last element to the beginning of the array and every other element one place to the right.It adds $1$ to each element of the array.It reverses the order of the elements in the array.