Given a binary number as a string, x$($a binary string$),$return the binary string of the same length, y$,$that will produce the maximum value when XORed with x There is a number of bits that may be set in y called maxSet code in java

Example

bits$=3$

maxSet $=1$

x $=101$

the binary strings will always have bits digits, and leading zeros are fine.

$1.$ First, determine all possible bits $=3$ digit binary strings with only maxBits $=1$ or fewer bits set: $000,001,010,100.$ these are the potential y values.

$2.$ Now XOR each of the y values with x $=101$

$2\mathrm{.}1000$ xor $101=101$

$2\mathrm{.}2001$ xor $101=100$

$2\mathrm{.}3010$ xor $101=111$

$2\mathrm{.}4100$ xor $101=001$

the third value produces the maximal result, where y $=010.$ Return the string $\text{'}010\text{'}.$