Points:

$\frac{?}{25}$

COs:

$[$No direct COs$]$

$[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

$[10$ pts$]$ Convert the following transition graph into the equivalent regular expression

$[5$ pts$]$ Name the accept states in the machine $L_2^{\text{'}}{L}_1($read as: $L_2$ prime union $($:$L_1$