Given the following pseudo code of an algorithm to sort the integers in ascending order:

$($i$)$ Identify the basic operation

$($ii$)$ Would there be a best and worst case that are different from each other or not? Justify your answer.

$($iii$)$ According to your answer for $($ii$),$ determine the number of times, the basic operation will be executed and the overall time complexity of the algorithm. Show all the Math$/$work$.$ ALGORITHM

Input: Array A $[0...$n$-1]$

Begin

for $(i=0$ to $n-2)$ do

boolean didSwap $=$ false

for $(j=0$ to $n-i-2)$ do

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

swap$(A[j],A[j+1])$

didSwap $=$ true

end if

end for

if $($didSwap $==$ false$)$ then

return; $//$ STOP the algorithm

end if

end for

End