please sir answer both question sequencially.I will upvote you

Draw the nondeterministic finite automata to accept the following language. Try to take advantage of non determinism as much as possible. a. The set of strings of 0s and 1s such that there are two 0s separated by a number of positions that is a multiple of 4 . Note that 0 is an allowable multiple of 4. b. The set of strings that either begin or end (or both) with 01 Convert the NFAs you constructed in Q3 into DFAs using subset construction. Draw the nondeterministic finite automata to accept the following language. Try to take advantage of non determinism as much as possible. a. The set of strings of 0s and 1s such that there are two 0s separated by a number of positions that is a multiple of 4 . Note that 0 is an allowable multiple of 4. b. The set of strings that either begin or end (or both) with 01 Convert the NFAs you constructed in Q3 into DFAs using subset construction