Let M=2 , N=3, bb=1 and input index key =  c, l, d, h, h, d, e, k, a, e, g, d, l, l, e, c, h, k, b, f, d, h, g, d, b, b, h. Show the external sorting using merge-sort.                                                 A.) Create runs (3 points)                                                      B.) Show merge pass (7 points) (Please upload file to answer the question.)

Suppose the program has page requires as: D, B, A, E, A, F, E, D, E, G, A, B. Show the buffer’s page allocation using the replacement policy: Second Chance(Clock Algorithm), where the buffer size = 3.  (Please upload file to answer the question.) 

The student data file(fixed length record) contains the following attributes: Id   : Varchar(10) (10 bytes) Name  : Varchar(17) (17 bytes) Phone :  Varchar(10) (10 bytes) GPA : Double (3 bytes) -all GPAs are null values.  And index file(fixed length record) contains the following attributes: Id   : Varchar(8) (8 bytes) Pointer: Double (2 bytes) There are 40,000 records in this data file. We want to store the data and index files in a hard drive with the block(page) size = 2KB ~ 2,000 B. The number of blocks or pages that need for storing the data file in a hard drive = _______ .  (The answer must be integer) The number of blocks or pages that need for storing the index file in a hard drive = _______ . (The answer must be integer) Given RAID level 10 for storing data and index files using 8 hard drives, how many blocks for each drive =  _______ . (The answer must be integer) and a data storage space = _______ % usage. (The answer must be integer)  

Factor completely x3 – 4×2 + 3x – 12

Factor completely x3 + 125

Factor completely xy + 7x – 3y -21

Factor completely x2 – 12x + 35

Factor completely 2×2 + 5x – 3

Factor completely 12×2 – 47x + 11

Factor completely -150×2 + 96