Exercise $9($Ex$.53,$ Chapter $1$ of $[$Martin; $2011]).$ For each of the finite automaton pictured below, use the minimization algorithm described in Section $2\mathrm{.}6$ and Lecture $2$ to find a minimum state finite automaton recognizing the same language. $($It is possible that the given FA may already be minimal.$)($e$)$

$($g$)($e$)$

$($f$)$