Construct a non-deterministic finite automata that recognizes L3

(10 points) Construct an NFA that recognizes language L3={xover{a,b}xcontainssubstringaaandendsinleast2bs}