PLEASE SOLVE COMPLETELY AND SHOW ALL STEPS.

1 Sorting Your manager calls you into the office with the following comment Alpha Beta Gamma is becoming a big-data company. Starting next month, every morning we will be receiving a large number of large lists of large values. We will need to sort the lists quickly. Each value in a list is an unsigned integer stored in four words of memory; so each value uses 256 bits (4 64) We hired you because you have a Computer Science degree from one of those fancy colleges. Nobody else here at Alpha Beta Gamma Soft ware has your education or ability. You have two weeks to write a lightning fast program to sort these lists. 1. As you leave, you realize that you have no idea how to write such a program becausPick one. If you would like, you can answer for an aquaintance or for a fictional character (a) You never actually graduated from college. You just pretended to have a degree on your job application (b) You did graduate from college, but you did not major in computer science (c) You majored in computer science, but your algorithms course barely discussed sorting. (d) Your algorithms course discussed sorting, but you did not go to class or do the homework (e) You did do the work, but you still did not understand the material. (f) You understood the course material, but have long since forgotten it (g) You still remember the course material, ut te theoretical material you learned in class has little to do with practical, real life sorting algorithms. (h) OTHER: FILL IN THE BLANK In any case you have to deal with the situation. You scour the Internet and find a well-regarded sorting package. It is just what you need: It allows you to input a list to be sorted with a parameter for how many words each value uses. You are all set, and can relax for the rest of the month, while pretending you are writing the sorting program In order to get exact results, for the remaining problems in this section, ignore the cost of preparing the lists for input into the sorting package or processing the results (assuming those costs are within reason) 2. Assume you are sorting k lists (of four-word values) with sizes (number of values) n,n.. . .nk where ni 1 Sorting Your manager calls you into the office with the following comment Alpha Beta Gamma is becoming a big-data company. Starting next month, every morning we will be receiving a large number of large lists of large values. We will need to sort the lists quickly. Each value in a list is an unsigned integer stored in four words of memory; so each value uses 256 bits (4 64) We hired you because you have a Computer Science degree from one of those fancy colleges. Nobody else here at Alpha Beta Gamma Soft ware has your education or ability. You have two weeks to write a lightning fast program to sort these lists. 1. As you leave, you realize that you have no idea how to write such a program becausPick one. If you would like, you can answer for an aquaintance or for a fictional character (a) You never actually graduated from college. You just pretended to have a degree on your job application (b) You did graduate from college, but you did not major in computer science (c) You majored in computer science, but your algorithms course barely discussed sorting. (d) Your algorithms course discussed sorting, but you did not go to class or do the homework (e) You did do the work, but you still did not understand the material. (f) You understood the course material, but have long since forgotten it (g) You still remember the course material, ut te theoretical material you learned in class has little to do with practical, real life sorting algorithms. (h) OTHER: FILL IN THE BLANK In any case you have to deal with the situation. You scour the Internet and find a well-regarded sorting package. It is just what you need: It allows you to input a list to be sorted with a parameter for how many words each value uses. You are all set, and can relax for the rest of the month, while pretending you are writing the sorting program In order to get exact results, for the remaining problems in this section, ignore the cost of preparing the lists for input into the sorting package or processing the results (assuming those costs are within reason) 2. Assume you are sorting k lists (of four-word values) with sizes (number of values) n,n.. . .nk where ni