Which property is true for regular languages?a.All of the aboveb.Closed under concatenationc.Closed under intersectiond.Closed under complement

Context-Free Languages are closed under which of the following operations?a.Kleene starb.Concatenationc.Complementationd.Intersection

What is the result of combining two regular languages with the union operation (∪)?Question 2Answera.The set of strings that are in either of the two languages.b.The set of strings that are common in both languages.c.The set of strings formed by concatenating strings from both languages.d.The set of strings formed by taking the intersection of the two languages.Clear my choice

f L1 and L2′ are regular languages, L1 ∩∩ (L2′ U L1′)’ will be _____.a)all of the mentionedb)may be regularc)regulard)none of the mentionede)non regular

A regular language over an alphabet ∑ is one that cannot be obtained from the basic languages using the operation ans. All of the mentioned Concatenation Kleene* Union

Question 1Prove that the class of context-free languages is closed under the concatenation operationi.e., if L1𝐿1 and L2𝐿2 are context-free languages, then L1∘L2𝐿1∘𝐿2 is context-free.