Exercise 3.7. Draw transition diagrams for NFAs that accept the strings de- scribed below, and then use the procedure discussed above to convert these NFAs to DFAs belou, and then use the procedure 1. Bit strings with either three Os or two 1s in a row. 2. Bit strings without three Os in a row. . Bit strings whose number of 1s is a multiple of 2 or a multiple of 3