Stuck on this computation question, can someone help me answer it. I have to draw an NFA for each that recognizes these conditions.

4. [6 marks] Design NFAs Let -{a, b, e). Draw an NFA recognizing each of the following languages: [2 marks] The set of strings that contain e's in runs of no more than two (e.g., a , ac, acc etc., but not accc etc.) (a) (b) [2 marks] The set of strings that contains 2 of the 3 possible characters (e.g., aabba, bcbb but not aabc), (c) 2 marks] The set of strings that contain no consecutive digits (i.e., a 0 cannot follow a 0, etc)