(a) Given a Boolean expression as F(A,B,C,D) AB+ACD+CD+BCD + ABCD+ABD+BCD i. Transform the given Boolean expression to standard SOP form. (6 marks) ii. Determine the truth table of the standard SOP form obtained in (i). (4 marks) iii. iv. Map the truth table obtained in (ii) into a Karnaugh map and express the standard POS expression, the minimization of SOP and POS expression. (9 marks) Draw the logic circuits for the both of minimized SOP and POS expressions. (6 marks) QUESTION 2 (a) Given a Boolean expression as F(W,X,Y,Z) = [XY(WZ+X) + WXZ+X]Y i. Simplify the Boolean expression using Boolean Algebra into Sum-of-Product (SOP) form. Show all the steps. (7 marks) ii. Produce the truth table of the Boolean expression above. (3 marks) iii. Simplify the Boolean expression using a Karnaugh map (K-map) method into POS form and show the simplified Boolean expression. (4 marks) iy. Choose the more simplified Boolean expression between (i) and (iii). Draw the chosen simplified Boolean expression logic circuit. (3 marks) (b) Convert the following Sum-of-Product (SOP) Boolean expression into a standard Product- of-Sum (POS) form using truth table method. Note that no simplification is required. Draw the logic circuit of the POS Boolean expression. F(A, B, C, D) ABC + BCD + ABCD + ABD = (8 marks)