Algorithms Question

Answer question fully for thumbs up.

Present with good hand writing and explanation.

Do not answer if you do not know what you are doing.

Question 2 A data processing company needs to sort massive arrays, with a very large number of records n (say, annual returns of tax payers). There are two sorting algorithms available: Sort1 performsn2 comparisons, and Sort2 performs n lo2 n comparisons. Consider two data sets: one with the number of records n1 11,000,000 (annual returns of UK taxpayers). and another one with the number of records n2 60,000,000 (annual returns of US taxpayers) Estimate the computation time of Sortl and Sort2 on each of the two datasets, assuming the company uses a computer that performs 108 operations per second. Present your calculations in two table:s Table 1: Performance of the first sorting algorithm (n comparisons) The estimated computation time in The estimated number of comparisons seconds minutes hours days n 11,000,000 60,000,000 Table 2: Performance of the second sorting algorithm (n log, n comparisons) The estimated number of comparisons The estimated computation time in seconds n,-11,000,000 n2 60,000,000