For each of the two FAs $($i$)$ and $($ii$)$ pictured on the last page of this assignment, build a transition graph that accepts the same language but has fewer states.$($i$)$ finite autom aton

$($ii$)$ finite automaton