Are the following statements true or false? No explanations are required. We have some fixed alphabet that we are working with. 1. If L is a non-regular language and R is a regular language then INR must be regular. 2. If L is a non-regular language and R is a regular language then LnR cannot be regular. 3. For every regular language there is a unique minimal NFA. 4. When we run the minimization algorithm on a DFA we cannot be sure that it will always terminate. 5. If L is an infinite regular language and L2 is a finite language then the DFA to recognize L must have more states that the DFA to recognize L2