Write a regular expression for each of the following (with concatention, kleene stars, unions, parenthesis, and/or unary plus):

d) All words on = {, }, that their number of as mod 3 is 2. () 3 = 2

Example: abbabaaa, abbba

e) All words on = {, }, that do not have the substring aba.