Consider the following Boolean function: f(A, B, C, D) A'BCD'+A'BCD+AB'C'D+ABC'D'+ABCD'+ABCD with don't cares for A'B'C'D', AB'CD, and ABC'D 1. Build a truth table of the function. 2. Construct a Karnaugh map (K-Map). 3. Determine the prime implicants and essential prime implicants. 4. Develop a simplified expression in the sum of products form. 5. Implement the function using the simplified expression. Draw your circuit design and build. 6. What are the outputs corresponding to the don't care cases? Why does the circuit return these results? Include this answer in your lab report.