Problem 4 (20 points) Given an input stream of 0 s and 1s, design a system that outputs the length, Z, of the largest palindrome found in the last 7 inputs, along with the parity, P, of the length of that palindrome. A palindrome is a string that is spelled the same forwards as it is backwards. For example, the following strings are palindromes: 10101,11,1001,0000. P is equal to 1 when the length of the palindrome is odd, and 0 when its length is even. Your system should only consider palindromes of length 2 to 7. For example, given the following input stream, 1010101, the output should be Z=7 and P=1. For the input stream, 1010000 , the output should be Z=4 and P=0. Use any flip-flops and combinational gates of your choosing to implement this system