Using the bijection rule to count binary strings with even parity. let b = {0, 1}. bn is the set of binary strings with n bits. define the set en to be the set of binary strings with n bits that have an even number of 1's. note that zero is an even number, so a string with zero 1's (i. e., a string that is all 0's) has an even number of 1's.(a)show a bijection between b9 and e10. explain why your function is a bijection.(b)what is |e10|? when answering the question use the bijection rule.