Question 4: 10 points We can put all the pieces together to make the Merge Sort Algorithm function MSORT(X) if len(X) > 1 then middle - len(X)//2 A- msort(X[:middlel) B- msort(X[middle:]) C- merge(A,B) return C else return X end if end function Below is a trace of how this functions sorts a list [2, 4, 1, 3, 6 1 Calling msort ([2, 4, 1, 3, 6]) 2Calling msort ([2, 4]) 3 Calling msort ([2]) 4 Calling msort ([4]) 5 Merge 2] and [4] 6 Calling msort ([1, 3, 6]) 7 Calling msort ([1]) 8 Calling msort ([3, 6]) 9 Calling msort ([3]) 10 Calling msort ([6]) 11 Merge [3] and [6] 12 Merge [1] and [3, 6] 13 Merge [2, 4] and [1, 3, 6] (a) (10 points) Write out what the trace should look like out if we asked it to sort the list [9, 5, 7, 2] This should look similar to the above example