Consider the following pseudocode:

for $i=0$ to $n-$ceil$(\frac{n}{2})$

for $j=0$ to $n-i-2$

if $A[j]>A[j+1]$

swap $A[j]$ and $A[j+1]$

end for

end for

print $($i$)$

end for

something $=\frac{A[ceil(\frac{n}{2})-1]+A[n-\text{c}\text{e}\text{i}\text{l}(\frac{n}{2})]}{2}$

$($a$)$ If this code is run on the following list, show the state of the list each time the i value is printed. Some of the rows are not necessary; just don't fill those in$.$

$\backslash$table$[[$Start$,15,10,7,9,5,3,1,6],[i=0$:$,,,,,,,,],[i=1$ :$,,,,,,,,],[i=2$ :$,,,,,,,,],[i=3$ :$,,,,,,,,],[i=4$:$,,,,,,,,],[i=5$ :$,,,,,,,,],[i=6$:$,,,,,,,,],[i=7$:$,,,,,,,,]]$

$($b$)$ For the example in $($a$),$ what is the value of something at the end?

something $=$

$($c$)$ In general $-$ not for the example in $($a$)-$ What is the value of something at the end?