Consider this sorting algorithm:

From the following, select the option that represents a ture statement for this algorithm.

Question $1$Answer

a$.$

The time complexity of the given algorithm is always $($n$2).$

b$.$

The loop invariant for the algorithm is: The subarray A$[1..($i$-1)]$ is norted in non$-$decreasing order.

c$.$

The best case scenario time complexity for the given algorithm is$($n$)($n$).$

d$.$

None of the above.