Consider the Bubble$-$sort algorithm. Which of the following statements is TRUE?: $*$

A$)$ After the first outer loop iteration, the largest element is moved to rightmost

position$($highest index$)$ if it was not already there.

B$)$ Its Best$-$case time complexity is $O(n^2)$

C$)$ It fails to detect whether the array is already sorted

D$)$ It is not an in$-$place algorithm

E$)$ None of the above