Boolean algebra, logic expression minimization $$(A\land \neg A)\lor((A \land B) \lor(A\land B\land \neg C ))$$
I'm trying to minimize this Boolean expression with boolean algebra but i cant minimize it completly can i get some help?

It can be simplified as follows:
\begin{array}{l}
& (A \land \neg A) \lor ((A \land B) \lor (A \land B \land \neg C)) & \text{ Given }\\
& F \lor ((A \land B) \lor (A \land B \land \neg C)) & \text{ Complement }\\
& (A \land B) \lor (A \land B \land \neg C) & \text{ Identity }\\
& (A \land B) \land (T \lor \neg C) & \text{ Distributive }\\
& (A \land B) \land T & \text{ Identity }\\
& A \land B & \text{ Identity }\\
\end{array}
