please answer this question and explain it.

Big-Oh. For each function f in the left column of the following table, choose one expression O(g) from the following list: O(n1),O(1),O(log2n),O(n),O(nlog2n),O(n2),O(n10),O(2n),O(10n),O(nn) such that fO(g). Use each expression only once. To make it easy, you may simply copy and paste the tex code for each answer (provided on the next page), in the correct table cell. Or, make a copy of the Google Does file linked here