justify why the satisfiability problem can have two complexity functions O$(2$n$)$ and O$($n$).$

You can read the textbook of this course section $14\mathrm{.}2($Turing Machine Models and Complexity