Consider that blocks can hold either ten records or 99 keys and 100 pointers. Assume that the average B+ tree node is atleast 70% full, i.e. except root it will have 69 keys and 70 pointers. The total number of blocks needed for a 10000, record file, if memory initially is empty, the search key is the primary key for the records and the data file is a sequential file, sorted on the search key, with 10 records per block with dense index are ________.
ANS GIVEN IS 1147.
