10. (a) A large file contains about 10 million records, enle contains about 10 million records, each of length 500 bytes. Every as a different key. Both random access and key-ordered sequential access to the records is required. State, giving brief r as is required. State, giving brief reasons for your choice, which method of file organisation you would suggest to provide fast access if (i) the keys are 3 bytes long; (ii) the keys are 4 bytes long. (Note: 210 1,000; 220 1,000,000; 230 1,000,000,000; where means 'is approximately :) (5 marks) Suppose that we delete a record from a B-tree and then immediately re-insert the same record. The resulting B-tree may be different from the original tree. Draw a B-tree of order 4 with a maximum of 3 records per data page for which deleting some record and then re-inserting it results in a B-tree with fewer levels than the original B-tree. State which record is deleted and then re-inserted, and draw the (6 marks) resulting B-tree. (b) 10. (a) A large file contains about 10 million records, enle contains about 10 million records, each of length 500 bytes. Every as a different key. Both random access and key-ordered sequential access to the records is required. State, giving brief r as is required. State, giving brief reasons for your choice, which method of file organisation you would suggest to provide fast access if (i) the keys are 3 bytes long; (ii) the keys are 4 bytes long. (Note: 210 1,000; 220 1,000,000; 230 1,000,000,000; where means 'is approximately :) (5 marks) Suppose that we delete a record from a B-tree and then immediately re-insert the same record. The resulting B-tree may be different from the original tree. Draw a B-tree of order 4 with a maximum of 3 records per data page for which deleting some record and then re-inserting it results in a B-tree with fewer levels than the original B-tree. State which record is deleted and then re-inserted, and draw the (6 marks) resulting B-tree. (b)