True / False Questions

(a) (b) Every subset of a regular language is regular. Let L be the language over -{a ,b} consisting of all strings of the form arnbn, where m,n 2 0. Then L is a regular language. (c)The complement of every regular language is regular (d) The Kleene closure of every context-free language is context-free (e) The intersection of any two regular languages is regular (f)The language consisting of all hexadecimal numerals for positive integers n such that n % 5-1 is regular. (g) The language consisting of al hexadecimal numerals for positive integers n such that n2 % 5-1 is regular