Q$3$: Consider the following algorithm, answer the questions below:

Bubble$-$Sort$($A$)$

for $i=1$ to A$.$length

for $j=$ A$.$length down to $i+1$

if $,A[j]harrA[j-1]T(n)0,A[j]$

$,$ exchange $A[j]harrA[j-1]$

$a$