$(6$ points$)$ Multiple choice questions. each sub$-$question $($a$),($b$),($c$),$ each of which is a multiplechoice question with $4$ answers. At least one of the answers is correct, and at least $1$ of the answers is wrong. You score $2$ points by selected all correct answers and no wrong ones, you get $1$ point if you select some $($but not all$)$ correct answers and no wrong ones. Otherwise you get $0$ points.

Consider the maximum subarray problem, and solving the problem using recursion. Consider element.

a$.$ Which of the following subarray$($s$)$ will be passed in one of the recursive calls? $($Not necessarily the initial recursive call$)$

i$.-2-7$

ii$.5-2-74$

iii. $\left[\begin{array}{cccc}4& -3& 1& 8\end{array}\right]$

iv$.[83]$

b$.$ In how many recursive call do the combine step actually return a better solution than the results of the recursive call?

i$.0$

ii$.1$

iii. $2$

iv$.$ None of the above

c$.$ For each of the four choices below, I make one change to the array. Which change will make the final result different?

i$.$ Change $[5\}$ to $3$

ii$.$ Change $A[0]$ to $6$

iii. Change to $-5$

iv$.$ Change $A[2]$ to $2$