(5] Let the alphabet S = {0, 1, 2, 3, 4, 5,6,7,8,9}. L is a language over , where L = {w the value of w (treated as a decimal number) is a power of 2}. For example, 2(2), 4(22), 8(23), 16(24), 32(25) are in L. Design a grammar to generate L with an explanation of your logic. What is the type of your grammar (Regular, Context-free, etc.)? Is L a context-free language (answer yes or no)