Computational Theory

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

3. (10 points) Construct an NFA that recognizes language { x over {a, b) I x contains substring aa and ends in least 2 b' s}