1. Devise and write down the truth table of P as a function of logic variables D3, D2, DI and DO using Table 5.2.2. 10 1 12 1 13 1 15 1 Table 5.2.2: Truth table ofprime number detector 2. Derive the canonical sum-of products (SOP) expression of the function P(Ds, D2, D, Do) from its truth table. 3. Use the Karnaugh map method to reduce this canonical SOP expression to the simplest SOP form. 4. Use the De Morgan's theorems to express the simplest SOP in terms of NAND operators; implement this expression using NAND gates only 5. Using Boolean algebra, try to minimize further the simplest SOP, at the expense of increasing the number of levels of logic gates