is the language of regular expressions a regular language?

The set REX of regular expressions over the alphabet
{a, b}
is itself a language over the alphabet
{e,0 , a, b, ), (*,U, .}

is this language regular?

I want to say yes, however, I am not sure what approach to take?
Which would be easiest? Construct a DFA or a regular expression?
Or am I wrong and this language is not regular?