Let L3 be a formal language using the letters h, a, i and o, such that a string is in L3 if and only if it has the string ohhai somewhere within it. N.B.: hhhohhaiyi is in L3, as are; hohhai, ohohhaih, and ohhaiio, but ohahai is not in L3.

A. Draw a nondeterministic FSA that recognizes L3. N.B. make sure it has at least six states in operation.

B. Write a regular expression whose language is L3.

C. Draw a deterministic FSA that recognizes L3.