Consider a language which is the set of strings of 0s and 1s with no consecutive 1s. For

example, sting 1000100101 is in language but string 011101101 is not

a) construct an NFA that recognizes this language

b) create Generalized NFA for the same language

c) use the state elimination technique to produce a regular expression that defines the same language.

Show your work! In particular show the result of elimination of each state.