2. Recall that the two operations that can be performed using dominos are Vand . Show how to implement a 1-bit adder (also known as a full adder) using only these two operations. Specifically, a 1 bit adder takes as nput the two put bits a and b and c the pre ous car y lt outputs the sum bit s and the next carry c t For example, if a = 1 b and c -0, then s-1 and C 13 The truth table for both functionss Fla,b, Cin) and Cout Cla, b, Cm) are shown below. Write Boolean expression for F and G using V and 0 1 0 1 0 1 0 0 1 0 101