Let A be a square matrix of size $n \times n$. Consider the following pseudocode. What is the expected output?C = 100; for i = 1 to n do for j = 1 to n do { Temp = A[i][j] + C; A[i][j]= A[j][i]; A[j][i] = Temp - C; } for i = 1 to n do for j = 1 to n do output (A[i][j]);

In the nested loop:

1. For each pair $(i, j)$:

   • Temp = A[i][j] + 100

   • A[i][j] = A[j][i]

   • A[j][i] = Temp - 100 = A[i][j]

This swaps the elements A[i][j] and A[j][i].

2. The nested loops run for all $i$ from $1$ to $n$ and all $j$ from $1$ to $n$:

   • For any off-diagonal pair where $i

e j$, the swap operation is executed twice: once when$(i, j)$is visited, and a second time when$(j, i)$is visited. - Swapping the two elements twice restores them to their original values. - For diagonal elements where$i = j$, swapping an element with itself leaves it unchanged.

Hence, the matrix remains unchanged, and the output is the matrix A itself (Option A).