Program $2,$Hamming$,$ will read in an integer $$k$$ and a bit string $$s$$ from the command line, calculate the $$Hamming Distances,$$ and prints all bit strings that have Hamming distance of $$k$$ from $$s$.$

Note: The Hamming Distance is equal to the number of bits in which the two strings differ.

A sample run would be as follows.

$>$java Hamming $20011$

$111110011010010101100000$