2. Show that the family of regular languages is closed under the nor operator given by nor (L1, L2) = {w:w Lland w & L2} 3. Show that there exists an algorithm for determining if E L for any regular language L. 4. Determine if the language L = {a" b'ak : n +1+ k > 5} is regular or nonregular and prove the result. 5. Determine if the language L = {W E ** : na (w) # ny (w)} is regular or nonregular and prove the result. 6. Determine if the language L = {wRwRw: w E * } is regular or nonregular and prove che result. 2. Show that the family of regular languages is closed under the nor operator given by nor (L1, L2) = {w:w Lland w & L2} 3. Show that there exists an algorithm for determining if E L for any regular language L. 4. Determine if the language L = {a" b'ak : n +1+ k > 5} is regular or nonregular and prove the result. 5. Determine if the language L = {W E ** : na (w) # ny (w)} is regular or nonregular and prove the result. 6. Determine if the language L = {wRwRw: w E * } is regular or nonregular and prove che result