- 2 Show The B Tree Of Order Three Namely Each Node Has A Maximum Of Three Keys Descendents That Result From Loading T 1 (146.78 KiB) Viewed 110 times
2. Show the B+-tree of order three (namely each node has a maximum of three keys/descendents) that result from loading the following sets of keys in order: a. M, I, T b. M, I, T, Q, L, H, R, E, K C. M, I, T, Q, L, H, R, E, K, P d. M, I, T, Q, L, H, R, E, K, P, C, A 3. Show the trees that result after each of the keys N, T, H, and Y is deleted individually and separately from the following B+-tree. Do not delete the keys based on the results you got. Each key should be deleted from the original tree. OPZI [ pa l'Amph D G M P LT Rxz TX Z IA BICID IKLIM QRISTIYIZ J EFIGII H Inolp ju|v||w| x] P U W X