Use the pumping lemma to prove that L = {0ⁿ | n is a power of 2} is not regular. Example strings from this language include 0, 00, and 00000000.
A. L is a regular language.
B. L is a context-free language but not regular.
C. L is not a regular language.
D. Pumping lemma cannot be applied to L.