$1.$ Write an algorithm that finds the largest number in a list $($an array$)$ of n numbers.

$2.$ Write an algorithm that finds the m smallest numbers in a list of n numbers.

$3.$ Below are a collection of cost functions. Order them from least to greatest cost.

nlog$2($n$)$

$($log$2($n$))^2$

$5$n$^2+7$n

n$^1/2$

n$!$

$4^$n

n$^$n

n$^$n $+$ log$2($n$)$

$$n

e$^$n

$8$n $+12$

$10$n $+$ n$^20$