Design a combinational circuit that can detect whether a pattern of at least three adjacent 1s occur anywhere in an 8-bit input, and that outputs a 1 in that case. The inputs are a , b, c, d, e, f, g, and h, and the output is y. So for an input of abcdefgh=00011101, y should be 1, since there are three 1s in a row. For an input of 10101011, the output should be 0, since there are not three 1s in a row anywhere. An input of 11110000 should results in y=1, since having more than three 1s in a row should still output a 1.