A$.\left[\begin{array}{cccccc}10& 8& 3& 5& 1& 8\end{array}\right]$

B$.(10855318)$

C$.(1085831)$

$(10$ pts$)$ What are the asymptotic time complexities of the follow$-$

ing algorithun?

A$.$ A recursive algorithm that halves the input in one step.

Time complexity:

item in the input.

Time complexity:

each input pairs.

Time complexity:

D$.$ An iterative algorithm that multiplies

Time complexity:

E$.$ An iterative algo

Time complexity: