For each of the following regular expressions over the alphabet {a, b}, say whether each one of the following strings is an element of the language described by the regular expression. Justifications arent required for credit for this question, but its good practice to think about how you would explain why your answer is correct

1. (10 points) For each of the following regular expressions over the alphabet fa, b), say whether each one of the following strings is an element of the language described by the regular expression. Justifications aren't required for credit for this question, but it's good practice to think about how you would explain why your answer is correct. a. Regular expression: (aUb). Strings(1) E (2) ab (3) bba b. Regular expression: aa Ubb. Strings: (1) (2) aa (3) ba c. Regular expression: (aUb)o (bua). Strings: (1) e (2) a (3) abba (4) bbb