Problem1 (25 points): Create a truth table according to these specifications: There are 4 input bits, x3, x2, xl, x0, and 3 output bits, s2, sl, s0. The 3-bit output is the largest number of consecutive O's in the 4 input bits. (x3 is the most significant bit of the input, and s2 is the most significant bit of the output) For example, input 0000 gives output 100 (four O's), inputs 0001 and 1000 give output 011 nputs 0011, 1001, and 1100 give output 010, etc Show all 16 rows of the table clearly. Refer to Chapter 6 Slide 9, where we filled out the truth table for the 2-bit adder. We also wrote out a logical expression for the s0 bit, following a sum of products approach. For the s0 bit of the new circuit, follow the same procedure and write out the logical expression