Problem 3. Execute mergeSort on the given vector A of integers. For each recursive call, show s, e, m and the content of A at the end of the recursive call. 1 evoid merge Sort (vector &A, int s, int e) { 2 if(s == e) 3 return; 4 int m = (s + e)/2; 5 merge Sort (A, s, m); 6 merge Sort (A, m+1, e); 7 merge (A, s, m, e);//merges sorted ranges As,m] and A[m+1,e] } 8 Run A before merge Sort(A, 0,7) 17 40 35 9 453 20 10 S= e- m= 5 $= es m= S= e- m= $= es m= $= e m= S= e= m= S= e- m= S= e- SE $ es S= es e- S= es S= e SE es