Please explain the answer. Thank you in advance.

1. Given the regular expression R: (aa)* | (bo* Let L be the language defined by R True or false: the string aabcaa is in the language L 6. Given the regular expression R: (aa)* (bo* Given the regular expression R: a (a | bd Let L be the language defined by R Let L be the language defined by R. True or false: the string aabca is in the language L U L 2. Given the regular expression Ri: (aa) (bd* Given the regular expression R: a (a b)* Let L be the language defined by R Let L be the language defined by R. True or false: the string abca is in the language LL2 7. Given the regular expression R: (a | b) (a | bo* True or false: the string bca is in the language defined by R. Given the regular expression R: a*baba Given the regular expression R: b* (a | aa aaa) b Let L be the language defined by R Let L2 be the language defined by R. True or false: the string aababa is in the language LL 8. Given the regular expression R: (a | ab)* True or false: the string aba is in the language defined by R. 9. Given the regular expression Ra: b* (a | aa l aaa) b* Let L2 be the language defined by R. True or false: the string aababab is in the language L* (the Kleene closure of L) 4. Given the regular expression R:: a*baba Let L be the language defined by R True or false: the string aabaa is in the language L 5. Given the alphabet f a, b select the regular expression(s) that precisely describe the language below: set of all strings ending with one or more b's Select as many as applicable Select one or more: (a | b) b* (a | b)* bx (a | b)* b a*b*b