Complete the following statements about the languages given, over the alphabet Σ={b, e}: Let R = e*b*(ebb*)*(ε ∪ e), which is all strings that do not contain “bee”. The language A = L(R) is [ Select ] not regular, R is not a correct regular expression not regular, R is a correct regular expression regular, R is not a correct regular expression regular, R is a correct regular expression . Let B = {bee}. The language B is [ Select ] regular not regular . The language D = {w∈Σ* | w contains the substring bee exactly once} is [ Select ] not regular, because D = A∪B, where one of the languages is not regular unknown, because D = A∪B, where one of the languages is not regular not regular, because D = A◦B◦A, where one of the languages is not regular unknown, because D = A◦B◦A, where one of the languages is not regular regular, because D = A∪B and regular languages are closed under concatenation regular, because D = A◦B◦A and regular languages are closed under concatenation . The language K = {w∈Σ* | w contains n occurrences of the substring bee, where n≥1} is [ Select ] D∪B DD* D* (D◦A◦B)* D*\A , and is therefore [ Select ] regular because regular languages are closed under concatenation and Kleene star not regular because the regular languages aren’t closed under concatenation not regular because regular languages aren't closed under Kleene star not regular because at least one of the languages isn’t regular unknown because at least one of the languages isn’t regular regular because the regular languages are closed under union .多重下拉选择题