Merge Sort has the Best, Worst, and Average-case complexity of O(nlogn). Can it get better than this for a comparison-based sorting algorithm? No. So Why wait? let’s learn this ASAP and accurately. We will also look at the shortcomings of Merge Sort at a later point. So I started out…