Design a circuit that takes two strings of binary digits and
outputs 1 (True) if the strings “partially” match, and 0 otherwise.
To keep this manageable assume the two strings are three bits long,
that is a1a2a3 and b1b2b3 where each ai or bi is a one or a zero.
The strings are a perfect match if for all i, ai = bi;. The strings
are a partial match if at most one i, ai is not equal to bi....