(a) Using Boolean algebra, minimise the expression Q=AB+A(B+C)+B(B+C) ( 9.33 marks) (b) Use a K-map to write the Boolean expression for a full adder circuit with 3 inputs A, B and Cin and two outputs S and Cout.. Design a full adder circuit using logic gates. The full adder truth table is chmum holow Figure Q2 (b) Full adder truth table (11 marks) (c) Sketch a typical 4-bit ripple carry adder constructed using full adder components. Use this to add binary numbers 1011 and 0011 . Convert these numbers to decimal values and confirm your