Please answer all parts. True or false and a short explanation!

Indicate whether each of the following statements is true or false and justify your answer. The Kleene closure of a language is always infinite. Let N be an NFA that recognizes language A. If we swap the accepting and nonaccepting states of N, the resulting NFA must recognize the complement of A. Let R and S be regular expressions. If R=(01) and S=(01), then R and S must generate the same language. Let A and B be languages. If AB is regular, then A and B must be regular. Let A be a language with pumping length p. The pumping lemma holds if there is at least one string sA with sp that can be divided into three pieces x,y, and z that satisfy the conditions of the pumping lemma