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

$T(n)0,$ Bubble$-$Sort $(A)$

$1.$ for $i=1toA.$length

$2.$ for $j=A.$length down $toi+1$

$3.ifA[j]$

$a$