How to answe this question?

let n be the size of input, given the number of steps for different algorithms in the following table, write down the corresponding big O complexity. The symbol means to the power of, So n 2 means n to the power of 2 Number of steps Complexity order (big O) (n/2(nA2+1) n(nlog(10)) log(5) (2An) n*2n 3n