Digital Logic

5. Find all the minterms and all the groupings on the following K-maps: 1 1 0 0 0 1 1 1 1 0 1 0 1 1 1 1 1 1 1 0 1 100 1 1 1 1 lolla 0 1 1 olo 0 1 1 1 0 0 1 0 1 1 1 0 1 1 0 1 1 1 1 1 0 0 1 1 1 1 0 1 o 1 0 olol 1 1 0 1 Olo 1 lo 1 1 0 0 1 1 lolo 0 0 1 1 1 0 1 1 0 0 1 6. Simplify the Boolean functions below using the K-map method. (Include all minterms, products and the final simplified function, Use variables A-horizontal, BC-vertical) a. F(A, B, C) = ABC + ABC c. F(A, B, C) = AB + BC + BC + ABC b. F(A, B, C) = AB + AB + BC d. F(A, B, C) = AB + ABC + AC 7. Simplify the Boolean functions below using the K-map method. (Include all minterms, products and the final simplified function, Use 3 vars A-horizontal, BC-vertical, 4 vars AB-horizontal, CD-vertical) a. F(A, B, C) = m (0,1,2,4,6) b. F(A, B, C) = m (0,1,3,5,7) c. F(A, B, C, D) = m (0, 2, 4, 6, 9, 11, 12, 13, 15) d. F(A, B, C, D) = m (1,3,4, 6, 9, 10, 11, 12, 14)