Mark the correct option. If we apply the AFN -> AFD (and simplification) transformation algorithm to the AFN below we can state:

a) The resulting automaton has a single final state b) The number of final states in the resulting automaton is equal to two c) The resulting automaton has exactly four states d) The resulting automaton has exactly five states e) No options from the previous ones

a b . 1 b