Implement the truth table below with a combinational logic circuit using only one universal logic gate type. Express each K-map as a sum of minterms function. Optimize the following Boolean functions using a 3-variable K-map F(A, B, C, D) = sigma m (0, 5, 10, 15) G(A, B, C) = sigma m (1, 3, 5, 7) H(A, B) = sigma m (0, 3) Assume that you have 24-bit inputs A and B, and a 3-bit output that is 100 when A > B, 010 when A = B,001 when A