ot N D2 D2 D D. P 0 0 0 0 0 1 0 0 0 1 2 1 0 0 1 0 3 0 0 1 1 4 0 1 0 0 5 0 1 0 1 0 1 0 0 1 1 1 1 0 0 0 1 0 0 1 10 1 0 1 0 11 1 0 1 1 12 1 1 0 0 1 | 13 | 1 1 0 1 | 14 1 1 1 0 0 | 15 1 1 1 1 0 Table 5.2.2: Truth table of prime number detector 2. Derive the canonical sum-of-products (SOP) expression of the function P(D3, D2, D1, Do) from its truth table. 6. Use the Karnaugh map method to reduce this canonical SOP expression to the simplest SOP form. CD 00 01 11 10 Figure 5.2.1: Karnaugh map template 7. Use the De Morgan's theorems to express the simplest SOP in terms of NAND operators; implement this expression using NAND gates only. Using Boolean algebra, try to minimize further the simplest SOP, at the expense of increasing the number of levels of logic gates