In this part you are going to do some calculations for the secondary B+ tree for the videos on Youtube. The index will be on video title which is known to be unique for each video.

The size of a key is 8 bytes and the size of a block pointer is 4 bytes. The block size of the disk is 1204 bytes. There are 7.000.000 videos and the average fill-factor is 70%.

How many leaf blocks are required if all the videos are indexed? (You can discard the right and left pointers in the leaf nodes.)