Samurai and the XORring Problem

Given an array $arr_1,arr_2,...arr_n$ consisting of $n$ non-negative integers. We define XOR value of some subarray $arr[i...j]$ as $arr_i\oplus arr_{i+1}...\oplus arr_j$. You have to answer $q$ queries, each of which will be one of the following two types. 1. $1$ $j$ 2. $2$ $j$ For the first query, you have to find out the number of subarrays of $arr$ that end at or before $j^{th}$ index of $a