Answer the following questions for the expression (0+1)*0(0+1):

1) Is the given expression a regular expression?

2) Describe the language defined by the given expression in your own words.

3) Write a formal definition for the language defined by the given expression.

4) Construct a Deterministic Finite Automaton (DFA) for the language defined by the given expression. Submit as a picture.

5) Construct a Nondeterministic Finite Automaton (NFA) for the language defined by the given expression. Submit as a picture.

6) Consider the following context-free grammar:

S -> A B

A -> 0 A | 0

B -> 1 B | 1

Derive the string "001" using the grammar rules above.