Question 3-Regular languages closed under operations Let & be some alphabet. We define the following operation on the set of all languages over E. The operation 3MAJ(L1, L2, L3) takes in three languages L1, L2 and L3 and outputs the language of all words that are members of the majority of the input languages. Formally: 3MAJ(L1, L2, L3) {we 2* | at least two out of the L1, L2, L3 contain w}, where =* is the set of all words over . Prove that the class of regular languages is closed under the operation 3MAJ