please help me i have only 15min

answer true or false

6. For each of the following circle either T for true or F for false. Grading is: t point for every correct answer and 1/2 point for every wrong answer. Unanswered questions are ignored. a. There is an unambiguous grammar for every CFI b. The intersection of two non-regalar CFL's cin be regular c. The union of a regular language and a non-regular language could be regular. d. There exist languages that are not CFL's but are regular. e. The complement of a CFL must be a CFL f. The complement of a non-regular language can be regular. g. PALINDROME ((ab+baa)b(aba+ab+ba)) is a CFL. h. Every finite language is a CFL i. There is an algorithm for deciding if a CFG is ambiguous. j. SASBSAaABbB generates (a+b) unambiguously. k. If L is a CFL then LLR must also be a CFL 1. We can use the pumping lemma for CFL's to prove a language is a CFL m. The grammar SaTTSba generates a regular language. n. Every CFL has a regular subset... o. There is an ambiguous grammar for every non-empty CFL p. The pumping lemma for CFL's uses the idea of 2 loops not too far apart. q. When using the pumping lemma for CFL's to prove a language is not a CFL you will never choose i=1 r. Every CFL has a regular grammar. s. When proving CFG=PDA the easier part is showing CFGPDA t. It is possible for a grammar to be ambiguous and have exactly 1 word with 2 distinct derivation trees