Insert the following into an initially empty R-tree assuming the maximum number of entries per node is 4 and the minimum number is 2. Show how the tree is incrementally built by showing the state every time an insertion causes a split -- show the state, including one node with 5 points in it when overflow happens and then tree after the split. Thus, if 5 node splits result from the set of insertions you should show 5 before (with the overflow node having 5 entries) and 5 after split states. If the tree is of height 3 (leaf, intermediate, and root) you should show the intermediate nodes also, not just the leaf nodes.
Points to insert (inserted in order first to last):