Given a binary No ${?}_0$ os string, $x($a binay simin relurn the binary string of same lenyth. that will produce maximum walue when $x_5$ with $x.$ There is No$.$ of bits that may be set in $y$ called max set

ex$.$

bits $=3$

maxset $=1,x=101$

binary string will always have bits digit, $?$ leading zeros are frone.

first determine all possiblebits $=3$ digit bina

Siring with only max Bits $=1$ or fewer bits set: $000,001,010,100,$ these are potenn y values.

Now, $x$@$R$ each of the $y$ values with $x=11$

$0000r,101=1015$

$0010r101=100.$

$010$ or $101=11\%.$

$10001=001$

The third value produce maximum result then $y=010,$ & Return Sming $.010$