What would be the best$-$case time complexity of the InsertInOrder$($key$,A,n$ algorithm whose pseudo$-$code is

given below?

$O(n)$

$O(logn)$

$O(n^2)$

$O(1)$