2. [15 points] Design an NFA (showing just the state diagram) for the following language, using only six states: {w{0,1} : there are at least three 0 s or at least three 1 s in w}. For example, 000 and 110110100 are in this language, but and 0110 are not. (By the way, it's impossible to decide this language with a six-state DFA, but you don't need to prove that.)