Consider the context free language {0"1" : n >0}. What is the smallest value p that we could take as a pumping length for this language (in other words what is the smallest value of p such that this language will satisfy the conditions of the pumping lemma for context-free languages with that value of p)? O 1 3 O 2 o 4. d C 5 O Consider the context-free language consisting of all palindromes (words that are the same forwards as backwards) over the alphabet {a,b}. We claim that this has pumping length 2. Which of the following would be a decomposition of the palindrome ababbbbaba that satisfies the conditions of the pumping lemma for this language with p=2? (The parts of the decomposition will be indicated with parenthesizes). O (aba)(b)(bb)(b)(aba) O (abab)()(bb)((baba) O (abab)(b)(b)(baba) (aba)(bb)(bb)(aba)