I’ve been struggling with the exercise for hours and I don’t understand where the problem is. I’d appreciate some help.

• Build a regular expression for the language that accepts the characters 1,0 so that the length of all words in the language is **even **and the language does not include the sequence “101”.

You can only use the following characters connecting for example 10
or + for example (1+0)
Appears zero or more times * example (1+0)*
I tried to divide into cases

(00)* + (11)* + (01) + (10) +
And in the next part I tried several ways but I did not find a solution
01(11+00)* (10) +
10+(11+00)*