A circuit needs to be built to perform the addition of two pairs of 3 bit (x0,y0,z0) and (x1,y1,z1) in parallel, i.e. x0y0z0 + x1y1z1. Show the 22-th row of the truth table for the first bit (from left) of the sum as well as the 17-th row for the second bit. The carryout is considered the first bit. If there is no carryout, it is 0. For example, 000 + 000 = 0000. Each row should be formatted as (x0, y0,z0,x1, y1,z1,output) and the rows should be separated by comma. The answer should look like (0,0,0,0, 0,0,0),(1,1,1,1,1,1,1). All inputs as 0 is the first row and all inputs as 1 is the last row in the truth table.