1. A logic circuit has three inputs C, B, A, where A is the least-significant bit. The circuit has three outputs R, Q, and P. For any binary code applied to the input terminals (A, B, C) the output is given by the input plus 1; for example, if C, B, A = 0,1,1, the output R, Q,P is 1,0,0. Note that 111 + 1 = 000 (i.e., there is no carry out). Draw a truth table for this problem, and obtain a simplified expression for each output. Implement the circuits. a) Use the Karnaugh map to obtain a simplified expression for the function. b) Construct a circuit to implement the function using NAND gates only. c) Construct a circuit to implement the function using NOR gates only