Create NFA for the star (regular operation) of the following languages; use the constructiongiven in class. For each, give at least three good strings, underlining each substring from the language. For example, for the star of all strings that start with a, here are three strings (substrings separated by spaces for readability): string 1: a abc aabcba a, string 2: aaaa; string 3: ab acac. The first shows four substrings from the underlying language, the second shows one, and the third shows two. Although all starred languages contain epsilon, do not give it as one of your substrings (but do make sure it is accepted in your diagram). Draw the diagrams, but do not give formal definitions for your NFA. Do not reduce (remove states, etc.) the constructed NFA in any way. The underlying FA can be DFA or NFA.

The language of all strings that

contain cab

contain exactly one b

are exactly two characters long