EXERCISE 4 Draw the diagram for an NFA for each of the following languages. Use as few states and as few transitions as possible. Don't just give a DFA, unless you are convinced it is necessary a. {re {a, b} * 1 x contains at least 3 as} b. lax e la, b| x starts with at least 3 consecutive as c, {re {a, b)* | x ends with at least 3 consecutive as} d. {x e {a, b)" | x contains at least 3 consecutive as} e. {x E {a, b} * | x has no two consecutive as) g lx e (0, 1* x ends in either 0001 or 1000 h. Ire {0, l)" | x either starts with 000 or ends with 000, or both EXERCISE 5 Draw an NFA for each of the following languages. Hint: Try combining smaller NFAs