Arithmetic Sequence XOR

You are provided with two integers: n (the length of a sequence) and start (the initial value of the sequence).

Construct an arithmetic sequence called sequence where each element at index i (using 0-based indexing) is defined by the formula:

sequence[i] = start + 2 × i

This generates a sequence of n evenly spaced integers, starting from start and incrementing by 2 for each subsequent element.

Your task is to compute and return the bitwise XOR of all elements in this sequence. The XOR operation (denoted by ^) compares each bit of its operands: if the bits are different, the result bit is 1; if they are the same, the result bit is 0.

For instance, if n = 4 and start = 0, the sequence would be [0, 2, 4, 6], and the result would be 0 ^ 2 ^ 4 ^ 6.