For the questions on this page, refer to the K-map shown below. ABICD 00 01 11 10 01 Using the dont-cares to best advantage, determine a minimal sum of products (SoP) implementation of the function represented by the K-map Then answer the below questions about the prime implicants that are actualy used in the minimal implementation How many prime implicants of size 8 does the implementation have? Note: the "size" of an implicant is the number of minterms included within t. Answer Check How many prime implicants of size 4 does the implementation have? Answer Check How many prime implicants of size 2 does the implementation have? Answer Check How many prime implicants of size 1 does the implementation have? Answer Check What is the gate input count of a minimized SoP implementation? Remember that we assume that the complements of the circuit inputs are available for free