(Solved): [10 pts] Convert the following transition graph into a finite automaton by filling in the (final) t ...

[10 pts] Convert the following transition graph into a finite automaton by filling in the (final) table and identifying the start and accept states. (You do not have to draw the state transition diagram for the FA - filling in the final table is enough - note: this isn't the intermediary table) Note: there may be more rows than you need in the table