File Organziation, B$+$ Tree Creation and Insertion and ERD

File Organization:

For a heap file organization, what is the purpose of a free$-$space map?

Explain briefly what sequential file organization is about.

What is an overflow block in sequential file organization? List one advantage and one disadvantage of using the overflow block for sequential file organization.

Creation and Insertion:

$4.$ Construct a B$+-$tree for the following set of key values: $(2,3,5,7,11,13,17,19,23,29)$

For this question, you don$$t have to follow the insertion algorithm $$ as long as you construct a valid B$+-$tree with the key values, you will get full credit.

With n $=4.($leave a blank cell between nodes to indicate it is a new node$)$

With n $=6.($leave a blank cell between nodes to indicate it is a new node$)$

Note: the answer is not unique. Keep in mind for a B$+-$tree index, all leaf nodes together form a dense index, whereas non$-$leaf nodes form a sparse index.

$5.$ Based on your answer for $1($a$)($n$=4),$ show the form of the tree after inserting $10$ into the tree.