5 A please

4. (20 points) Consider a hashing technique that distributes 1200 records across 400 blocks (addresses). Assume a uniform distribution of the records across the blocks, and that 4 records can be stored at every block address without an overflow a. How many block addresses will be empty? bHow many blocks will overflow? In the Be trees given below, every node must contain at least 2 key values (except the root) but never more than 4 key values s. (20 points) a. Diagram the top tree after the index value [50] is deleted. b. Diagram the bottom tree after the index value (38] is added. 17 34 38 48 22 26 9 13 46 8 10 12 14 16 18 20 23 24 17 22 26 34 48 214 1618 20 23 24 28 30 35 36 40 4205S 6. (20 points) Design a polyphase external sorting system for the 9 storage devices where we have 1,000,090 records, and can only sort 12,500 records in memory. The destination device for the sorted data is device 1. Give the number of initial runs, the size of the initial runs and the distribution of the runs across the 9 devices