Question(Regular Language).

The language L1 = {a" sa" | n > 0 and s *} is regular. The language L2 = {absa" | n >0 and $ *}, however, is not regular. You may assume ? = {a,b}. 1. Prove that L is regular. 2. Prove that L2 is not regular