Can someone please answer this? (Subject: Discrete Mathematics):

** RLG = Right linear grammar 1. In each of the following cases for the language L given over Sig={a,b}: - give an nfa for L, - hence, give an RLG for L.

a) L = L((aab*ab)*)

2. Show that the following languages are not regular, using the pumping lemma. a) L = Pal({a,b})