MergeSort originally merges two equal length sorted arrays at the final Combine step as in Divide and Conquer. However,

[answerhappygod]

Mergesort Originally Merges Two Equal Length Sorted Arrays At The Final Combine Step As In Divide And Conquer However 1 (30.07 KiB) Viewed 27 times

MergeSort originally merges two equal length sorted arrays at the final Combine step as in Divide and Conquer. However, per request we now want to split the input array in 3 equal segments and then recursively call MergeSort on all 3 of them. A. How would you implement the new Merge() routine to do the final combine? You may show us the pseudocode, or simply describe the change in plain English, in no more than 4 full sentences. (3pts) B. And what is the Big-O-of-n time complexity for this updated version of MergeSort? (2pts)