// Algorithm MergeSort (A[1...n]) // Input: An array A[1...n] if n=1 return 1 else B[1...n/2] C[1...n/2] Merge (B, C) Merge Sort (A[1...n/2]) MergeSort (A[n/2+1...n]) Remember that merging two sorted arrays B and C into one sorted array costs n time. Now Set up a recurrence relation for the algorithm's running time and solve it