Can someone show me step by step how to simplify this boolean expression? I would like to learn how to handle this kind of simplifications:

$$
Y = \neg(D \wedge\neg E) \vee (\neg E \wedge D )
$$

I can apply boolean laws for the first steps, that should be:

1. De Morgan's law : $\neg D \vee \neg\neg E \vee (\neg E \wedge D)$
2. Elimination of double negation : $\neg D \vee E \vee (\neg E \wedge D)$

From here i don't know what to do. Except that final result is $\top$.