Consider the B+ tree below with the following properties:

• Each node (except the root) contains 2≤k≤4 keys.
• Inner nodes: The keys in the subtree below the pointer pi are less than the key ki; the keys in the subtree below the pointer pi+1 are greater or equal than the key ki.
• Insert operations may only trigger node splits but not shifting of keys into bordering leafs.
• When a node is split, the middle key is moved to the parent node.
• Pointers p1,…,p4 in leaves point to row IDs. Pointer p5 in leaves points to the next leaf.

How does the B+-Tree look like after insertion of the key 30?