Two arrays (let’s say ar and br ) of same length(n) are given. I need to print a permutation of br so that (ar[0]^br[0])=(ar[1]^br[1])=(ar[2]^br[2])=…=(ar[n-1]^br[n-1]) if exist otherwise print “No” in optimized time complexity. (^ represents xor operation)