Construct an NFA for each of the following languages

(a) {w : w contains exactly three as and it ends with abb}

(b) {w : na(w) mod 3 = 0 and w begins with ab} (c) {w : (na(w) + nb(w)) mod 3 2} (d) {w : |w| mod 2 = 0}