1. Show a deterministic finite automaton that accepts all binary strings with at least 41 's. 2. Show a deterministic finite automaton that accepts all binary strings with a number of 1 's divisible by 3 . 3. Show an NFA that accepts all binary strings with two 1's in a row or that contains three 0 's in a row. 4. Convert the NFA from 3 To a DFA 5. Give a regular grammar that generates strings on the alphabet {a,b} of the form anbbbam where n and m are greater than 0