Problem Link $-$ Maximum Xor Queries

Problem Statement:

You are given an array$/$list 'ARR' consisting of $\text{'}N\text{'}$ non$-$negative integers. You are also given a list 'QUERIES' consisting of $\text{'}M\text{'}$

queries, where the $\text{'}$i$-$th$\text{'}$ query is a list$/$array of two non$-$negative integers $\text{'}$Xi$\text{'},\text{'}$Ai$\text{'},$ i$.$e 'QUERIES$[$i$]\text{'}=[\text{'}$Xi$\text{'},\text{'}$Ai$\text{'}].$

The answer to the ith query, i$.$e 'QUERIES$[$i$]\text{'}$ is the maximum bitwise xor value of $\text{'}$Xi$\text{'}$ with any integer less than or equal to

$\text{'}$Ai$\text{'}$ in 'ARR'.

You should return an array$/$list consisting of $\text{'}N\text{'}$ integers where the $\text{'}i-$th$\text{'}$ integer is the answer of 'QUERIES$[$i$]\text{'}.$

i need in c$++$ if you able to solved correctely then solved other wise skip