Let sigma = {a, b}. For each regular expression, describe the language of the regular expression by choosing one of the sets named below, or saying "none" if the language of the regular expression is not any of the given sets. Sets may be used more than once or not at all. Sets: A = {w sigma*| w does not contain the substring bb} B = {w sigma*| w contains the substring bb} C = {w sigma*| w starts or ends with bb} D = {w sigma*| w starts and ends with bb} E = {w sigma*| w does not end with bb} F = {w sigma*} Regular expressions: bb(a b)*bb (ba a)* (ba a)*b (ba* a)* bb(a b)* (a b)*bb bb(a b)*bb bb bbb b*b*(a b)* (a b)*b*b* (bb)* (a ab)* b(a ab)* (a b)*(a ab) b (a* b*)*bb(a b)*