Consider the following Boolean function: F(a, b, c, d) = ∏ M…
Consider the following Boolean function: F(a, b, c, d) = ∏ M(0, 1, 4, 5, 10, 11) 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 maxterm 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) PoS Boolean expression. Write the resulting optimal (minimal) PoS Boolean expression. Draw the optimal PoS 2-level circuit and state the name of the 2-level circuit. Redraw the logic circuit as a 2-level logic circuit using NOR gates only. Write the Boolean expression of a 2-level logic circuit using NOR gates only.