Creating a regex from regular language

Question

I need to create a regex from this language:

$L = \{w\sigma \mid w \in (\Sigma − \sigma)^*; \Sigma = \{a, b, c, d, e\} ; \sigma \in \Sigma\}$

but I don't understand the logic of this language.

If $\sigma \in \Sigma$ then $w$ is just an empty group, isn't it?

I would appreciate any help.

Thanks in advance.

Answer 1

Hint. Actually $\sigma$ is one of the letters $a, b, c, d, e$, which gives you five possibilities. For instance, if $\sigma = a$, then $\Sigma - \sigma = \{b,c,d,e\}$ and thus $w \in \{b,c,d,r\}^*$. Does it help you to find the regular expression?