Consider the Language l = {epsilon, a, b, cd , efg}
which of the following automaton will accept this language?
i) Finite Automaton
ii) Finite Automaton with only one stack(acceptance by empty stack)
iii) DPDA with 1 more stack.
a) i, ii, iii
b) i, ii
c) i, iii
d) only iii