Given the following statements:
Which of the following options is correct?
Based on the above closure properties,
(A) is TRUE. Because Regular Languages are an example of being closed under union and complementation, and thus under intersection.
(B) is FALSE. Because Recursively Enumerable Languages are closed under both union and intersection but NOT under complementation.