1- Find a minimal Boolean equation for the function in Table 1 and sketch a circuit for the simplified function. Remember to take advantage of don t care entries. A B C D Y 0 0 0 0 0 0 0 1 0 0 1 0x 0 0 1 1 0 0 1 0 0 0 1 0 1 0 1 100 0 1 1 x 1 0 0 0 1 0 0 1 1 0 1 0 1 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 X Table. 1 2. A circuit has four inputs and two outputs. The inputs A3:0 represent a number from 0 O 15 Output P should be TRUE if the number is prime (O and I are not prime, but 2. 3, 5, and so on, are prime). Output D should be TRUE if the number is divisible by 31 Give simplified Boolean equations for each output and sketch a circuit. 3- Write a minimized Boolean equation for the function performed by the following circuit: CD 11 T