aubreywelchhhhh2874 aubreywelchhhhh2874 17-10-2022 Computers and Technology contestada chegg consider the mergesort algorithm again. let us now deal with the general case when n is any integer. then, the worst-case number of key-comparisons is as follows.