Regular Expression: Writing an expression with at least two characters in length?

A past exam question: (1) Consider the language, L, of strings over the alphabet {x, y} of length at least 2 with the second symbol being x. For example, yx, xxyy, and yxy are members of L while xy, yyy,and yyxx are not in L.

(a) Write a regular expression to describe the language L.

I thought perhaps EXE* would be the correct answer, but then E could be either an empty string or X or Y, and the empty string would make it no longer valid because X wouldn’t be the second symbol. Is there some kind of statement that could (x + y)XE*?