Someone hacks into your sorted array of n distinct elements, and randomly displaces one element (shifting everything in between its initial and final position). For example, displacing 2 in 1,2,3,4,5 might result in 1,3,4,2,5. Between standard Insertion-sort and Merge-sort, which would you use to minimize the worst-case time of getting the array back in sorted order? Why? Given these conditions, one of the two algorithms will be slower in the worst case. But there’s a quick and easy fix to make it just as fast. Can you find it?