Exercise 3.4. Draw transition diagrams for NFAs that accept the strings de- scribed below. 1. Bit strings with either at least three 0s or at least two 1s n a row. or more precisely using a regular expression, (0 +1)*(00011) (0 +1)*. 2. Bit strings containing a run of exactly three Os or a run of exactly two 1s As a regular expression, this is the following 3. Bit strings without a run of three or more 0s, that is, 0+00 (1+01+001)* 4. Bit strings whose number of 1s is a multiple of 2 or a multiple of 3, or as 1*