Given an input Array of non. negative numbers , and a query  array where each query element is tuple of 2 indices of array (i.e left index and right index).
for each query ewe have left and right index, calculate number of subarrays (in between left index and right index ) such that
xor sum of that subarray +1 == xor sum of that subarray^1