Design a deterministic pushdown automaton that recognizes the language {akkdi 1,k > 1} Draw a table that traces the behavior of your pushdown automaton on the input abbccccdd. The table should list the current state, currently remaining input, and current stack contents at each step of the computation (see examples on pages 217-218). = Note: Since the pushdown automaton has to be deterministic, we cannot use the general transformation that converts a grammar to a pushdown automaton (as discussed on pp. 218 219 in the text.)