For each of the two FAs $($i$)$ and $($ii$)$ pictured on the last page of this assignment, describe in words and give a regular expression for the language accepted by each one.$($i$)$ finite automaton

$($ii$)$ finite automaton