2:05 Blackboard Read Only - You can't save changes to Save a copy this file. Digital Labs Use K Maps to find the minimized Boolean expression. 1) Minimize the following boolean function- F(A, B, C, D)=Em(1, 3, 4, 6, 8, 9, 11, 13, 15) + Ed(0, 2, 14) Solution- Since the given Boolean expression has 4 variables, so we draw a 4 x 4 K Map. We fill the cells of K Map in accordance with the given Boolean function. Then, we form the groups in accordance with the above rules. 2) Minimize the following Boolean function- F(A, B, C) = {m(0, 1, 6, 7) + Ed(3.5) Solution- Since the given Boolean expression has 3 variables, so we draw a 2 x 4 K Map. We fill the cells of K Map in accordance with the given Boolean function. . Then, we form the groups in accordance with the above rules