QUESTION 1: Consider the following grammar then answer the questions below:

G = ({S, A, B}, {0, 1}, S, P)

P: S 01A

A 0A | 1A | B

B C001

C

A. Is the above grammar linear? Why?

B. Is the above grammar regular? Why?

C. What is the language generated by the grammar

G? You can use regular expressions.