Complete (a-c) for just the left automaton, not both.

3. For each of the two automata 1F 2F 8 7 3F 4 2 4F 3 5 7 2 4 (a) say which states are accessible and which are not; (b) list the equivalence classes of the collapsing relation defined in Lecture 1 3 (c) give the automaton obtained by collapsing equivalent states and removing inaccessible states