please code in MATLAB

Question 2 (0.5 credit) Using the tree plot on slide 32 from Lecture 02: Getting Started with Sorting Problems, illustrate the operation of merge sort on the array A= (13, 41, 52, 6, 38, 7, 9, 49). Question 3 (1.5 credit) Bubble sort is a popular, but inefficient, sorting algorithm. It works by repeatedly swapping adjacent elements that out of order. BUBBLESORT(A) for i = 1 to A.length - 1 2. for j=i + 1 to A.length 3. if A[j]