Count Subarrays with Given XOR Problem Statement

You are given an array of integers ARR and an integer X. Your task is to determine the number of subarrays of ARR whose bitwise XOR is equal to X.

Example:

Input:

The first line contains a single integer ‘T’, the number of test cases. Each test case comprises:
1. A line containing two integers N and X. 
2. A line with N space-separated integers, the elements of ARR.

Output:

For each test case, output the count of subarrays whose XOR is equal to X, each on a new line.

Constraints:

• 1 <= T <= 10
• 3 <= N <= 5 * 10^4
• 0 <= X <= 10^9
• 0 <= ARR[i] <= 10^9

Note:

A subarray ‘B’ of an array ‘A’ is derived by deleting elements from the start and/or the end of ‘A’. You need not print anything; the core function should return the results.