Suppose we start with an empty B-tree and keys arrive in the following order. 1, 12, 8, 2, 25, 6, 14, 28, 17, 7, 52, 16, 48, 68, 3, 26, 29, 53, 55, 45 Build a B-tree with t=3 Hints 17: insert/split/promote 68: insert/split/promote 3: insert/split/promote 45:insert/split/promote.

I know other questions on chegg say order of 5. Make sure this is with t=3, otherwise I will vote negatively.