II$.$ Consider the following Finite State Automaton $($FSA$)$

A$.$ Is this a deterministic or a non$-$deterministic FSA? Why?

B$.$ Write a regular expression that specifies the same language that this FSA

accepts.

C$.$ For each of the following strings, if it is accepted by the FSA above circle Yes

and give a sequence of states that proves it is accepted. If not, circle No$.$

i$.$ a Yes: states $\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$ No

ii$.$ a b c Yes: states $\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$ No

iii. a b a c Yes: states $\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$ No

iv$.$ a b b c Yes: states $\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$ No

v$.$ a b a b a b c Yes: states $\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$ No