Creation and Insertion:

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$ and

With n $=6.$

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.

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

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$ and

With n $=6.$

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.

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