Nondeterministic Construction $[6$ points$]$

Generate the state diagram for an NFA which decides the language $B$ over the alphabet $=\{a,b\}.$ Make sure to clearly indicate your start state and final state$($s$).$ You do not need to provide the $5-$tuple.

$B=\{w$:$w$ contains $\text{'}aa\text{'}or\text{'}ab\text{'}\}$