(15 points) Construct an NFA that recognizes language L3 = {x over {a,b,c} x starts with an 'a', cannot end with 'a' and contains substring 'c' or substring 'bb')