Question $1$

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.

Example

bits $=3$

maxset $=1$

$2x=101$

The binary strings will always have bits digits, and

leading zeros are fine.

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.

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

$000$ or $101=101$

$001$ o$101=100$

$010$ xor $101=111$

$100$ or $101=001$

The third value produces the maximal result, where

$y=010.$ Return the string $\text{'}010\text{'}$

Function Description