What would be the best

$-$

case time complexity of the InsertInOrder

$($

key

$,$

$$

$,$

$$

$$algorithm whose pseudo

$-$

code is

given below?

$$

$($

$$

$)$

$$

$($

$$

$$

$$

$$

$)$

$$

$($

$$

$2$

$)$

$$

$($

$1$

$)$