can you answer these please.

1. [10 pts) Write a regular expression for a language L, using the alphabet (a, b) where all strings in the language L start with any number of a's and b's, followed by aba, or start with any number of a's, followed by bbb 2. [10 pts] Draw a finite automaton that models the regular expression abb(ab)*