Test algorithms please list the ones that are always true and show explanation

Thanks

Consider the following pseudocode: Algorithm 1: TestAlg(A) Input: A is an array of real numbers, indexed from 1 to n n leftarrow length(A); 2 for j leftarrow 1 to ([n/2]) do 3 k = n + 1 - j; A[j] leftarrow A[j] + A[k]; A[k] leftarrow A[j] - A[k]; 6 A[j] leftarrow A[j] - A[k]; Which of the following invariants are true at the end of every iteration of the for loop? The sub-array A[1... j] contains its original contents in the same order The sub-array A[1... j] contains the original contents of sub-array A[(n + 1 - j) ... n] in reverse order. The sub-array A[1... j] contains its original contents in reverse order. The sub-array A[(n + 1 - j)... n] contains its original contents in the same order. The sub-array A[(n+1 - j)... n] contains the original contents of sub-array A[0... j] in reverse order. The sub-array A[(n + 1 - j) ... n] contains its original contents in reverse order. (Just list the ones that are always true.)