Plz tell me answer of the below question
In automaton theory ,a PDA is a variation of:
1)finite automaton that can make use of a stack containing data
2)infinite automaton that can make use of a stack containing data
3)both A and B
4)none of the above