Given an array arr$[]$ of N positive integers. Find an integer denoting the maximum XOR subset value in the given array arr$[].$

Example $1$:

Input :

N $=3$

arr$[]=\{2,4,5\}$

Output : $7$

Explanation :

The subset $\{2,5\}$ has maximum

subset XOR value. dont solve by chatgpt write approach time compexity analyse complexity else i will give dislike $.$ i dont want answer in big format i need consice answer