Consider the following Boolean function: G(a, b, c, d) = Σ m…
Consider the following Boolean function: G(a, b, c, d) = Σ m(0, 1, 3, 4, 5, 10, 11, 14, 15) Draw the proper truth table in order for this Boolean function. What should the output be in your Truth table and the corresponding square in your K-map at each minterm location? Draw and fill the proper k-map(s) (that matches the labels of the truth table and include all values). Show the proper grouping in your k-map(s) to find the optimal (minimal) SoP Boolean expression. Write the resulting optimal (minimal) SoP Boolean expression. Draw the optimal SoP 2-level circuit and state the name of the 2-level circuit. Redraw the logic circuit as a 2-level logic circuit using NAND gates only. Write the Boolean expression of a 2-level logic circuit using NAND gates only.