Computer Science 240 Project No.8 (Simplifying Boolean functions) Names 1. Find the complement of the following expressions ii. (ab+cld'+e ili. ab+(c'd+cd) iv. (a+ b'+cla'+ca+b) Simplify each of the following Boolean functions using K-map 2. a. F1-20,1,3, 5,7) b, F2(0,2 , 3, 4, 6): d. F4- 57,6,8,9)...-.. ".." c F3-,12.5 89.10.13)' FS-To,1,3,5,7,8,9,13,15) f. F6-2(0,2,8,10,11,14,15) b. F5- For the Boolean functions E, F, G, and H as given in the following truth table. i. List the minterms of each function 3. 000 1 0 1 0 0 0 1 1 o 0 1 010 1 1 1 0 011 0 1 01 100 0 0 1 1 1 0 1 0 0 o 1 110 0 1 11 1 11 0 1 11 ii. Simplify each function using K-map G- H- ii. Draw a circuit for each simplified functions. Use graphic paper