Another approach to deskewing is to consider the bit stream as a sequence ofnon-overlapping groups of n bits each and output the parity of each group.That is,if a group contains an odd number of ones, the output is 1; otherwise the outputis 0.a. Express this operation in terms of a basic Boolean function.THE ANSWER IS the input bits s1,s2, ….,sn and the output bits o as o = s1 + s2, …. sn b. Assume that the probability of a 1 is 0.5 δ. If each group consists of 2 bits, what is the probability of an output of 1?THE ANSWER IS 0.5- 2δ^2c. If each group consists of 4 bits, what is the probability of an output of 1? THE ANSWER IS 0.5- 8δ^4d. Generalize the result to find the probability of an output of 1 for input groups ofn bits. The limit as n goes to infinity is 0.5