$10\%$ Consider the following function. Given an array $A[1..n]$ of numbers and an

input integer $m(1mn),$ return the sum: $A[1]+$dots$+A[m].$

$F\frac{A,n,m}{\frac{?}{?}}$AddA$[1]$ to

sum $=0$;

for $i=1$ to

sum $={\displaystyle \underset{?}{\overset{?}{}}}+A[i]$

$\}$

return sum;

$\}$

a$)$ What values of $m$ will be the $($a$)$ worst case; $($b$)$ best case? And how many

statements will be executed in these two cases?

b$)$ Based on the following probabilities, calculate the average number of

statements to be executed in the average case. The probabilities that the

value of $m$ will be: other

values, i$.$e$.,2$ or $3$ or dots or $n-1.$