Write the code in pseudocode or python or c++ explain please the space complexity

The length of the array cannot be supposed

Exercise 128. Consider the following algorithm: ALGO-X(A) 1 for i = 3 to A. length for j = 2 to i -1 for k = 1 to j-1 X = A[i] y = A[j] z = A[k] if x > y swap x + y if y > z swap y - 2 if x > y swap x - y if y - x == 2 - y return TRUE 15 return FALSE Analyze the complexity of ALGO-X and write an algorithm called BETTER-ALGO-X(A) that does the same as ALGO-X(A) but with a strictly better asymptotic time complexity and with the same space complexity. 14 (20) Exercise 128. Consider the following algorithm: ALGO-X(A) 1 for i = 3 to A. length for j = 2 to i -1 for k = 1 to j-1 X = A[i] y = A[j] z = A[k] if x > y swap x + y if y > z swap y - 2 if x > y swap x - y if y - x == 2 - y return TRUE 15 return FALSE Analyze the complexity of ALGO-X and write an algorithm called BETTER-ALGO-X(A) that does the same as ALGO-X(A) but with a strictly better asymptotic time complexity and with the same space complexity. 14 (20)