A Boolean equation derived directly from a truth table or from a problem statement usually is not in the simplest form. To have an efficient equivalent logic circuit, the Boolean equation representing the logic design must be in the simplest from. Boolean equations can be simplified using Boolean algebra, DeMorgan's theorem, or/and Karnaugh maps. In this experiment, we will verify Boolean distribute law, absorption rule and DeMorgan's theorem. PROCEDURE: Part I Prove this following Boolean distributive law using VHDL code. A (B C D)AB AC AD X1=A (B C D) X2=AB AC AD