How to count total subsets with XOR value equal to power of 2

[nirvana_codech]

I am trying to solve a problem where we need to find number of subsets in range L to R (in an array with n 32 bit integer) where XOR of all elements of the subarray is a power of 2.

[code_dad]

problem link