Answer step by step.

Consider the following Boolean function: F(a, b, c, d) = 1 M(4, 5, 8, 9, 12, 13) A. Draw the proper truth table in order for this Boolean function. B. What should the output be in your Truth table and the corresponding square in your K- map at each maxterm location? C. Draw and fill the proper k-map(s) (that matches the labels of the truth table and include all values). D. Show the proper grouping in your k-map(s) to find the optimal (minimal) PoS Boolean expression. E. Write the resulting optimal (minimal) PoS Boolean expression. F. Draw the optimal PoS 2-level circuit and state the name of the 2-level circuit. G. Redraw the logic circuit as a 2-level logic circuit using NOR gates only. H. Write the Boolean expression of a 2-level logic circuit using NOR gates only