Given any regular language $L$. How you will determine if $L=L^{*}$ ? For each of the following languages, say whether it is regular or not and give a proof. 1. $L=\left\{a^{n} b^{n} a^{n} \mid n \geq O ight\}$ 2. $L=\left\{a^{n} b^{n+1} \mid n \geq 0, 1 \geq 1 ight\}$ CS.VS. 1093|