Given array arr of length n$,$ we define function f$($arr$)$ as$,$ifn$=1,$ f$($arr$)$ arr$[1]$else$,$ f$($arr$)=$ f$($arr$[1]^$ arr$[2],$ arr$[2]^$ arr$[3]....,$ arr$[$n$-1]^$ arr$[$n$])$where$,$ is bitwise XOR operatorFor example, arr $=[1,2,4,8],$ n $=4$f$(1,2,4,8)=$ f$(1^2,2^4,4^8)=$ f$(6,12)=$f$(3^6,6^12)$ f$(5,10)=$ f$(5^10)=$ f$(15)=15$You need to answer q queries, each query youare given two integers $/$ and r$.$ For each, what isthe maximum of f for all continuoussubsegments of the array arr$,$ arr$1+1....,$ arrSample TestcaseInputn$=6$arr $[1,2,4,8,16,32]$q$=3$queries $=[11,31.[2\mathrm{.}5].[1\mathrm{.}6)$