Please answer these

ELEG 3063 - Logic Circuits Homework Three 2017 Fall Semester Dr. S. T. Koay 1. Simplify the following Boolean functions using four-variable map (a) F(A,B,C,D)= (1,4,5,6, 12, 14, 15) (b) F(A, B, C, D) A' B'C' D' + AC'D' + B'CD, + ABCD + BC'D 2. Convert the following Boolean function from a sum-of-products form to a simplified product-of- sums form: F(x, y, z) (0.1.2.5, 8, 10, 13) boolar tacion F(A,B,C,D)= (1.3, 5, 7, 13, 15) 4. Simplify the following Boolean function F, together with the don't-care condition d: 5. Implement the following Boolean expression with exclusive-OR and AND gates: 6, Design a combinational circuit that compares two 4-bit numbers to check if they are equal. The F(A,B,C,D)-(2.4, 7, 10,12), d(A, B,C,D)-(0,6,8) output of the circuit is equal to 1 if the two numbers are equal and 0 otherwise