Show output as well

1) Implement Merge Sort and Merge algorithms. (Preferred language: python) 2) Test your code on A=[2,1,6,3,4] 3) Show the array status for each recursion after executing lines 3,4 , and 5 in the picture. In other words, for each recursion, how does the array look like after line 3 , after ine 4 , and after line 5 ? MERGE-Sort(A,p,r) 1 if p