I just started taking the comp theory class, will it be possible to answer those questions with explanation. thank you

1) Given the following English descriptions of a language, write a regular expression which defines the language, and draw a state diagram of the FA which accepts the language. For all languages, let = {a, b}. a) The language consisting of all words having a number of a's that is a multiple of 3. b) The language consisting of all words that contain "babb". c) The language consisting of all words that end in "ba". d) The language consisting of all words that do not end in "ba".