1. Devise and write down the truth table if P as a function of logic variavles D3 D2 D1 and D0

2. Derive the canonical sum of products expression of the function P from its truth table

3. Use the karnaugh mao method to reduce this canonical SOP to the simplest SOP form

4. Use the De Morgans theirems to express the simplest SOP in terms of NAND operator; implement this function 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

and DO using Table 5.2.2. 10 0 01 0 0 4 0 10 0 0 0 0 0 0 10 1 0 1 0 11 1 0 1 12 1 1 0 0 13 1 1 0 14 1 1 1 0 15 1 11 1 Table 5.2.2: Truth table of prime mumber detector