3. (15%) Boolean function \( f(x, y, z, w) = -x \vee (x \wedge y \wedge z \wedge w) \vee (x \wedge y \wedge z \wedge -w) \). First, find the truth table of function \( f \). Second, simplify the expression of \( f \) to minimize the number of AND, OR, NOT operations. Third, draw out the combinatorial circuit corresponding to your simplified expression. Finally, transform and redraw your combinatorial circuit to contain NAND gates only.