Answer Happy

help needed asap
procedure function(a1,..., O(n) O 0(1) O O(n²) a real numbers with n ≥2) O(logn) for i:=1 to n - 1 forj:=1 to n - i if a; > a; + 1 then interchange a; and a; + 1 What is the worst-case scenario time complexity of this algorithm? {a₁ an is in increasing order}