You may assume that $n$ is a power of two. We have n input keys that form a reverse sorted sequence for example . We run MergeSort on that input. Find a tight upper bound that describes the number of comparisons performed by MergeSort on that input. If the upper bound is of the form (A/B) n Ign + Cn +D where, A = B= D= Provide the integer values A,B,C,D in the space available. 2.0 is not an integer. A/B indicates a fraction of two integers of the smallest possible size (eg 10/30, 3/9, 1.0/3.0 will never be answers but 1/3 will be).