We have a logic function in its minterm form: F(A, B, C, D) = m(0,2,3,4,8,11,14,15) + d(7, 10, 12) Here A: MSbit, D: LSbit, d(...) contains the don't cares. Tasks: a) Set up the K-map of this function. b) Use loops to achieve the hazard-free minimum form. c) Put down this algebraic form of the reduced function. d) Draw the solution with gates. You can use gates with any number of inputs.