hello, I need help with this computer science question.

1. For the alphabet {a, b, c}, let L be the language of all nonempty strings x such that:

if x starts with the symbol a, then it ends with the symbol b,

if x starts with the symbol b, then it contains no c, and

if x starts with the symbol c, then it has even length

Give a Regular Expression for L.