Construct a PDA that recognizes the following language: Every prefix contains at least as many a's as b's Hint: To get the maximum number of points, use as few states and nonterminals as possible! Alphabet: {a, b} Stack alphabet (the first symbol is the initial one): {$, X} o