Problem $1$

Build a $2-3-4$ tree using the keys entered in the following order. Show the intermediate $2-3-$

$4$ trees after every node$-$splitting happens during the building process.

$119521838914762401316124$

Problem $2$

Consider the following $2-3-4$ tree. What will be resulting $2-3-4$ tree if one of the following

keys is from the tree?

a$)$ Remove $7$

b$)$ Remove $10$

c$)$ Remove $20$

d$)$ Remove $9$

Submission

NO submission is needed.

$12$

$6810$

$23$

$17$

$79111520$