Which of the following functions is likely to grow the fastest, meaning

that the algorithm is likely to take the most steps, as the input size, n$,$

grows sufficiently large?

A$.$ O $($n$)$

B$.$ O $($sqrt $($n$))$

C$.$ O $($log n$)$

D$.$ O $($n log n$)$

E$.$ They would all be about the same.