6. When using the CF pumping theorem to show that a language Le CFLs, you must show that for some possible pair of values for v and y, and for some q 0, uvaxyqZ L. T F 7. Like the regular language pumping theorem, the CF Pumping Theorem guarantees that the pumpable region of a string w occurs within the first k characters. TF T F 8. The CFLs are closed under intersection with a regular language T F 9. Lw w is Java source code that compiles with no errors). Le TF 10. It is possible to represent the logic of a Java compiler as a Turing T F 11, ? = {a,b), L { w : w = (ab)nanbn, n 0). A CF Pumping CFLS. machine Theorem proof tries to show that Le CFLs, starting with defining w as (ab)kakbk, and then dividing w into 3 regions: It is possible that v could be the last ab pair in region 1, and y the last a in reaion 2 and the first b in region 3