PLEASE ANSWER WITH CLEAR EXPLAINATION!!

Let S = {a,b,c}. For each of the languages below on 2, draw the transition diagram of an NFA that accepts it. (a) L = {w : w does not contain all three letters of the alphabet } (b) L = {w : w contains the substring aa and ends with bb} (c) L = {W : w contains the substring aa and ends with ab}