arrows that go from a state to itself are acceptable at a state which is not an accept or start state (and should stay where they are. There should be no arrows to itself at a start or accept state.

Problem 2 (4 pts each): Use the method presented in class to modify each of the GNFA shown below to a GNFA accepting the same language and having the following additional properties (1) Has only one accept state, separate from the start state. (2) Has exactly one arrow from each state to each other state except a. There are no entering arrows to the start state. b. There are no exiting arrows from the accept state. ={a,b,c,d}