(10 pts) Draw the state diagram for an NFA that accepts binary strings containing two 0's separated by 3k l's for some k (10 pts.) Convert the following e-NFA to an equivalent DFA: 0 qo ql q2 is another symbol ofe, the empty string). You'll need to do two conversions: e-NFA to NFA and then to DFA for this