Give the transition diagram for a DFA over the alphabet -{a,b,c} that accepts a string w iff w contains ab as a substring but does not contain abb as a substring. [Hint: use the text-search approach together with the product construction and complementation] What is the least number of states you need