Problem 3: Array Reversal We have come through an old algorithm whose name indicates that it reverses the array elements; its pseudo-code was defined as follows: note n := A.length denotes the size of the array, number of items. Algorithm 2 REVERSE-ARRAY(A) s+ [), e t ) while s >0A e < (n – 1) do swap (A[s], A[e]) s + s – 1 e + e +1 end while a) Implement the algorithm in Python, and test it b) Empirically, show the performance curve of the algorithm using time measurements c) Using the basics of the theoretical analysis, write the complexity of its worst-case time. d) Prove that the algorithm is actually correct

PYTHON: Please provide a screenshot of your code in Python. Thank you!

15. Consider the problem of finding the first position in which an array b occurs as a subsequence of an array a. Write two nested loops: let result undefined for (let i = 0; i < a.length - b.length; i++) { for (let j = 0; j < b.length; j++) { if (a[i+j] = b[j]) . . . } } Complete with labeled break and continue statements.