Maximum XOR of Two Numbers in an Array

Problem Statement: You are given two arrays of non$-$negative integers say 'arr$1\text{'}$ and 'arr$2\text{'}$ of sizes $N$ and $M$ respectively.

Find the maximum value of $(\text{'}A\text{'}$ xor $\text{'}B\text{'})$ where $\text{'}A\text{'}$ and $\text{'}B\text{'}$ are any elements from 'arr$1\text{'}$ and 'arr$2\text{'}$ respectively and 'xor'

represents the bitwise xor operation. Maximum XOR of Two Numbers in an Array.

give me the c$++$ code with runing properly