Matching.

A function f$($n$)$ is of higher order than g$($n$)$ if f$($n$)$

In other words, f$($n$)$ is of higher order than g$($n$)$ if g$($n$)$ is an asymptotic lower bound to f$($n$).$ Match the following functions based on their order. Assign the number $1$ to the function with the lowest order. Assign the same number to functions with the same order.