What is meant by equivalence of RE and FA in Theory of Automata and Formal Languages?

A. regular expressions describe only context-free languages B. regular expressions and finite automata describe the same class of regular languages C. regular expressions are more powerful than Turing machines D. finite automata describe only context-sensitive languages