Array bitwise operations

Given an array a$,$ consisting of $N$ integers. You are also given $q$ queries on the array that you need to perform on the array $a.$ Each query is of the following two types:

Ir $O-$ Find the or of array elements on the segment $1,r,$ that means the value $a_i|a_{i+1}|dotsdots..|a_r|,$ where $|$ is the bitwise OR operation.

Ir $x-$ Apply $a_i=a_{i}o+x$ for all i such that $lir,$ where $o+$ is the bitwise XOR operation.

For each query of type $1,$ print the result you get.

Function description Complete the solve$0$ function. The function takes $4$ parameters and returns a single integer denoting the answer to the question:

N$.$ Represents the length of the array

$a.$ Represents the array

$q.$ Represents the number of queries

queries. Represents a $2$D array of size q with each row consisting of $4$ elements $(T,1,r,x)$ representing the queries

Input format for custom testing Note: Use this input format if you are testing against custom input or writing code in a language where we don't provide bollerplate code.

The first line contains an integer $N$ denoting the length of the sting.

The second line contains $N$ space$-$separated integers representing the array $a.$

The third line contains a single integer $q$ denoting the number of queries

Next $q$ lines contain $4$ space$-$separated integers T$,$ I, r$.$ and $x$ denoting a query.

Output format Print a single integer for each type $1$ query.

Code in java