Help me this question on Automata. Thank you, please explain to help me understand

Q1. 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 = {a"b"a"|n2 0} 2. L = {a" bn+l In > 0,12 1}