Given the adjacency matrix `A` of a directed graph with `n` vertices, construct and print the adjacency matrix of the **transpose graph**, obtained by reversing the direction of every arc. The transpose graph has matrix `B` such that `B[i][j] = A[j][i]`. Input: The first line contains the natural number `n`. The following `n` lines each contain `n` binary values separated by spaces, representing the adjacency matrix of the given directed graph. - `1 <= n <= 50` - the matrix may contain `0` or `1`, with `0` on the main diagonal Output: The program prints the adjacency matrix of the transpose graph, with values on the same row separated by a single space, one matrix row per output line. Example: Input: 4 0 1 1 0 0 0 0 1 0 0 0 1 0 0 0 0 Output: 0 0 0 0 1 0 0 0 1 0 0 0 0 1 1 0