NEED QUESTION 3 ANSWER AND EXPLANATION PLEASE. WILL RATE.

ALSO IF POSSIBLE, PLEASE LET ME KNOW IF MY QUESTION2 IS CORRECT (IF INCORRECT YOU DO NOT NEED TO TELL ME THE CORRECTION).

making a table listing the outputs for all possible input combinations. Note that in each column there is a sum bit which is put at the bottom and a carry bit that is taken to the next column. So we need to specify two output bits for each input combination. Let us call the two data bits A and B. (These are the bits in the two bottom rows of the sum, corresponding to the given numbers to be added.) We call the input carry Sin. The output bits will be S for the sum bit and Cout for the output carry. The summation is shown symbolically below, together with the table giving the outputs for each input combination. Each row of the table is filled in simply by writing in binary the sum of the three bits A +B+Cin, using 0 = 00, 1 = 01, 2 = 10, and 3 = 11. Olo D Cout A B Cin Couts 0 0 0 00 00 0 1 00 01 10 00 01 0 11 01 00 1 0 0 00 01 1 0 1 01 00 1 10 01 00 1 11 01 01 zo D A B Cin 2. Write the Boolean functions for Cout and S based on the truth table (sum of minterms): Cout = (3, 5, 6, 7) 0, 1, 2, 4) S = (1, 2, 4, 7) , 3, 5, 6) 3. Write the Boolean functions for Sout and S based on the given logic diagram (simplified functions): Cout S =