consider this array with mergesort $[3,25,11,8,19,13,15,7].$ a$)$ show the steps of the array as it gets subdivided at each recursion level. b$)$ show the sorting thsg happens at each step as the recursion unwinds