Let $R_1$ and $R_2$ be regular sets defined over the alphabet, then
"Regular languages are closed under Intersection, Union ,Kleens Closure ,Compliment"
According to this point option C is perfect
64.3k questions
77.9k answers
244k comments
80.0k users