The answer is 2-to-the-power-of-n, since for every input, the number of different combinations doubles. From your list I think answer A is meant to indicate 2ⁿ.
Upper case and lower case problem
<span>When a job is sent to other countries, as many programming jobs have been, it is said to have been datamined. </span><span>
false</span>
