Consider the context-free grammar S → SS | aSb | λ When following the CFG-to-PDA conversion process learned in class, there is only one state in the resulting PDA that has a self-loop. Of all the PDA triples on this self-loop, write the shortest one that contains an "a" or a "b" anywhere in the triple in the box below (if there is more than one shortest, write any of them). Do not write any spaces. If you need a lambda or empty stack symbol, write exactly "lambda" or "emptystack" in its place. For this problem, the length of a triple is the number of characters in the triple when written down on paper, so a, b,emptystack is five characters long.