Qustion. 1 (10 points) For the following Boolean function shown in the K-map below: F(A, B, C, D) = m(0, 1, 4, 5, 7, 8, 10, 12, 13, 14, 15) Fixe 01 11 10 CD AB 00 00 1 1 0 0 01 1 1 1 0 11 1 1 1 1 10 1 0 0 1 (5 points) (a) Simplify the Boolean function F into a minimal Sum-of-Products expression. (b) Implement the function F using the minimum number of NOR gates only. (5 points)