2. Give an NFA accepting the following language. As in the previous question, you can describe your NFA with a diagram or a formal description. Try to use the smallest number of states. L = {w = {0, 1}* | every 4 consecutive symbols contains at least 2 0's}