Please solve all i will upvote you Thanks

Show that the language L{a,b}" consisting of words which begin with aba and have even length is regular. What is a regular language and what do we know about them? Draw a DFA/NFA. Write down a regular expression. Use theory of regular languages. 1. Prove that the following languages are not regular. (a) {a?"|n>0} {a} 2. Construct pushdown automata that accept each of the following languages. (a) {a2mbm e {a,b}* | m >0}