Module 32 Worksheet In Class Questions 1) (S5) What would happen if we had a finite capacity stack? Say at most 1000 characters could be pushed on the stack. 2) (S8) Describe how this change to the configuration makes it possible for a PDA with a finite number of states to handle languages with an infinite number of equivalence classes. Take home review questions 1) How do we make a move of a PDA pop a character off the stack? 2) How do we prove a language is in LPDA? 3) What is our default assumption about any PDA? Is it deterministic or nondeterministic? 4) Can a PDA be nondeterministic even if for all states q, all tape alphabet characters a, and all stack alphabet characters A, (q, a, A) has at most one element?