1. Consider the language L described by the regular expression: ( 0 1(01* 0)* 1 ) *

a. List all strings in L of length five or shorter.

b. Draw a DFA or NFA that recognizes L. You dont need to use the construction we discussed, just make sure whatever automaton you come up with recognizes L.

c. Suppose the strings in L are taken to be integers represented in base-2 (possibly with leading 0s). Describe the set of integers that are in L. (By describe, I mean a simple characterization like All the prime numbers.)