computer scienceRelate to a recursive sorting algorithm called QuickSort, which is described as follows: A one-element list is already sorted; no further work is required. Otherwise, take the first element in the list, call it the pivot element, then walk through the original list to create two new sublists, $L_{1}$ and $L_{2}.$ $L_{1}$ consists of all elements that are less than the pivot element and $L_{2}$ consists of all elements that are greater than the pivot element. Put the pivot element between $L_{1}$ and $L_{2}.$ Sort each of L1 and L2 using QuickSort (this is the recursive part). Eventually all lists will consist of 1 element sublists separated by previous pivot elements, and at this point the entire original list is in sorted order. This is a little confusing, so here is an example, where pivot elements are shown in brackets: Original list: 6, 2, 1, 7, 9, 4, 8; After 1st pass: 2, 1, 4, [6], 7, 9, 8; After 2nd pass: 1, [2], 4, [6], [7], 9, 8; After 3rd pass: 1, [2], 4, [6], [7], 8, [9] Sorted. Illustrate QuickSort as above using the list 8, 4, 10, 5, 9, 6, 14, 3, 1, 12, 11. computer scienceSuppose that a disk unit has the following parameters; seek time s = 20 msec; rotational delay rd = 10 msec; block transfer time btt= 1 msec; block size B = 2400 bytes; interblock gap size G = 600 bytes. An EMPLOYEE file has the following fields: Ssn, 9 bytes; Last_name, 20 bytes; First_name, 20 bytes; Middle_init, 1 byte; Birth_date, 10 bytes; Address, 35 bytes; Phone, 12 bytes; Supervisor_ssn, 9 bytes; Department, 4 bytes; Job_code, 4 bytes; deletion marker, 1 byte. The EMPLOYEE file has r = 30,000 records, fixed-length format, and unspanned blocking. Write appropriate formulas and calculate the following values for the above EMPLOYEE file: a. Calculate the record size R (including the deletion marker), the blocking factor bfr, and the number of disk blocks b. b. Calculate the wasted space in each disk block because of the unspanned organization. c. Calculate the transfer rate tr and the bulk transfer rate btr for this disk unit. d. Calculate the average number of block accesses needed to search for an arbitrary record in the file, using linear search. e. Calculate in msec the average time needed to search for an arbitrary record in the file, using linear search, if the file blocks are stored on consecutive disk blocks and double buffering is used. f. Calculate in msec the average time needed to search for an arbitrary record in the file, using linear search, if the file blocks are not stored on consecutive disk blocks. g. Assume that the records are ordered via some key field. Calculate the average number of block accesses and the average time needed to search for an arbitrary record in the file, using binary search. 5th EditionDavid A. Patterson, John L. Hennessy220 solutions

7th EditionJames Fitzsimmons, Mona Fitzsimmons103 solutions

5th EditionJack T. Marchewka346 solutions

3rd EditionMichael Sipser389 solutions