Since there is no such input size where merge sort is faster than insertion sort, then based on the general time complexity of the sorting algorithms, merge sort will be the obvious solution. Is this correct? Based on the standard competition ranking, is the following correct for the scores 10,20,20,40: 1. Get_rank_time(2) would return the first "20"? 2. Get_rank_time(3) would return the last "20"? 3. Get_possible_rank(20) would return rank 2? 4. Get_possible_rank(30) would return rank 4? Thanks.