Xor profit problem

#1

cann anyone explain the question a bit more clearly.

#2

@Himanshu-Sajwan-2271264282963988 you will be given two numbers, x and y.

You have to find 2 numbers in the range [x, y] such that their XOR is maximised.
for eg x = 5, y = 6
the numbers in this range are [5, 6]
So the possible pairs we can make are
5,5
5,6
6,5
6,6
If we perform a XOR operation on these pairs, like 5^5 or 5^6, we will obtain a value.
We have to find the pair which will give us the MAXIMUM value upon doing XOR operation on it.

Is it clear now? If yes, please mark the doubt as resolved.