Given an pseudo code

for(i = 0; i < a. Length; i = i+1){

for(j = 0; j < a. Length; j = j+1){

if(even){

A[i, j] = 1;

}

}

}

1) what is the time and space complexity in terms of the big-o given that there is X rows and R columns?

2) what is auxiliary space compare to space complexity, you can use the algorithm above to explain.