You are given a sorted integer array nums containing $n$ non negative integers, and an integer maximumBit.

You must execute $n$ queries as follows:

1. Determine a non negative integer k such that $0 \leq k < 2^{\text{maximumBit}}$ and the bitwise XOR sum of all elements in the current array nums along with k is maximized.

2. Remove the last element from the current array nums.

Return an array ans of size $n$, where ans[i] represents the answer to the $i^{th}$ query.

Constraints:

• nums.length $== n$

• $1 \leq n \leq 10^5$

• $1 \leq$ maximumBit $\leq 20$

• $0 \leq$ nums[i] $< 2^{\text{maximumBit}}$

• nums is sorted in ascending order.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.