Answer
see the detailed answer
Work Step by Step
We are given two bit strings, representing two sets. We want to represent the set of elements that are in the first set but not the second. Thus the bit in the ith position of the bit string for the difference is 1 if the ith bit of the first string is 1 and the ith bit of the second string is 0, and is 0 otherwise.