Consider the recurrence equation
$$T(n) = \begin{cases}2T(n - 1), & if n> 0\\1 & otherwise\end{cases}$$
Then T(n) is (in big O order)

A

$$O(n)$$

B

$$O(2^n)$$

C

$$O(1)$$

D

$$O(\log n)$$