You will be building a 2-bit adder. this device will take in two 2-bit values, a and b, and add them together. we need need three bits to represent the largest possible result (11 + 11 = 110), so the output of the device will be a 3-bit result, c. complete the following steps to design your adder and show your work. construct a truth table with four inputs and three outputs the inputs will be a1 and a0, to represent to the two bits of input a, and b1 and b0, to represent the two bits of input b. the outputs will be c2, c1, and c0 to represent the three bits of output c. a0, b0, and c0 represent the least significant bit of a, b, and c respectively. in the input column, record every possible combination of 0s and 1s. recall, for four inputs there will be 16 entries in the truth table the easiest method for ensuring you have every combination is to write 0-15 in binary in the output column, record the results of adding a1a0 and b1b0 for each entry for example, your 6th input entry should be 0101. that means both a and b are 01, which is equal to 1. 1+1=2, so the output entry should be 010. create a karnaugh map for each output column. recall, since there are 16 values each map will be a 4x4. review the algorithm for identifying prime and essential implicants. identify the minimized logic functions for each bit of the output. construct a gate diagram for each of the three output bits.