Minimum Xor On Segment

You are given an array $A$, consisting of $N$ integers and $Q$ queries. Each query is of the type: - $L$ $R$: Given $L$ and $R$, $(1 \le L < R \le N)$, your task is to output **minimum** XOR of any two elements from the subarray $A[L, R]$ of array $A$. More formally, for each query $L,$ $R$, your task is to calculate **minimum** value of $A_i \oplus A_j$ over $L \le i < j \le R$, where $\oplus$