b) The following is a sorting algorithm that uses the same merge routine as merge sort. Show an upper bound on its running time. [10 marks] Recall that the merge (A, low, mid, high) routine call joins the sorted segments A [low...mid] and A[mid+1... high] into a new sorted list, then copies it into A[ low....high] . void sort2(int [] array, int n){ int chunk=1; while (chunk <>