Answer T or F regarding Machine Automata. Give explanation if possible

Let L be the language over -{a, b} consisting of all strings of the form aTny, where m,n 2 0. Then L is a regular language The complement of every regular language is regular .The Kleene closure of every context-free language is context-free If a language has an unambiguous context-free grammar, then it is is accepted by some deterministic push-down automaton. If a language has an ambiguous context-free grammar, then it is is not accepted by any deterministic push-down automaton. There is a PDA that accepts all valid C++ programs. The intersection of any two regular languages is regular The language consisting of all base 7 numerals for positive integers n such that n % 3 2 is regular The intersection of any two context-free languages is context-free Let L be the language over ) {a, b} consisting of all strings of the form a"be", where m, n 0. Then L is a context-free language Let L be the language over 2- fa,b} consisting of all strings of the form a"b", where m > n. Then L is a context-free language