a. for sorting a bridge hand? which method is best heapsort, Merge exchange, or comparison?

b. For sorting a large class grades? which method is best,Heapsort, Merge exchange, or comparison?

c. Fort sortiing a large state license plates? which method is best? Merge exchange, heapsort, or comparison?

please explain the difference between heapsort merge exchange and comparison Thank you

We are sorting lists n symbols in length. The number of steps N to sort a list (and thus the computer time needed for the task) grows (in general) as the list length n growth. Thus N(n) can be modeled as an increasing function of n. Computer scientists can show that depending on the method used for sorting the behavior of N(n) differs and can be described by the expressions in the leftmost column of the table below. (1) Use this information to estimate N values for various methods and for various n and write your estimates in the table below. n 10 n 102 n 106 Comparison Nc(n) = 4n2+10n Merge exchange NM(n)-3.7n * In2(n) Heapsort NH(n)-23nln(n)+0.2n