Automata and Computability

9) (10 points) Show a possibly nondeterministic FSM to accept the following language a) {w e ta, b, c* w has the a as the third to the last letter (w e fa, b, c)*: w contains both ab and bec as substrings'. So abcc e L.) b) (Note that they may overlap. pg. 3