2. Nondeterministic Construction [6 points] Generate the state diagram for an NFA which decides the language B over the alphabet Σ = {a,b}: B = {w: w contains 'aa' or 'ab'}