Test Algorithm

Just list the ones that are always true

Merge Sort Question

Provide Clear Explanation and do all parts

Consider the following pseudocode: Algorithm 1: Test Alg (A) Input: A is an array of real numbers, indexed from 1 to n 1 n length (A) 2 for j 1 to (LI) do Ak Ak Which of the following invariants are true at the end of every iteration of the for loop? i. The sub-array A(1...jl contains its original contents in the same order ii. The sub-array A 1 1 contains the original contents of sub-array AI(m 1-j) n in reverse order iii. The sub-array A1...j contains its original contents in reverse order. iv. The sub-array A(n 1 -j).. n contains its original contents in the same order v. The sub-array A (n +1-j)... n] contains the original contents of sub-array A10 in reverse order vi. The sub-array A(n 1 -j) n contains its original contents in reverse order. Just list the ones that are always true