In an automata or formal-language problem, which option best represents regular languages closed under union?

Correct Answer: A

the union of two regular languages is also regular

In this course context, regular languages closed under union means the union of two regular languages is also regular.