Theory algorithms question:

Question 3. Let L be the language L-w E (a, b]": w does NOT contain aba as a substring). a. Draw the transition graph for an NFA that accepts L and has just one accept state. b. By reducing the number of states in that NFA, find a regular expression that denotes the language L