[Solved]Construct Btree Following Set Key Values 52 61 46 38 33 76 14 17 35 21 Assume Tree Initia Q37298273

1. Construct a Btree for the following set of key values:(52, 61, 46, 38, 33, 76, 14, 17, 35, 21). Assume that thetree is initially empty and values are added in the presentingorder. Draw the steps for building the Btree for the case where thenumber of pointers, not values, that will fit in one node is fiveor 2d = 4.

2 a. Draw the Btree resulting after deleting key 21.

2 b. Draw the Btree resulting afterdeleting key 82. Use the tree you draw for point (a).

3. Describe the uses of sequential files for sequential filesfor sequential search, range search, and key search?

Expert Answer

---

Answer to Construct a Btree for the following set of key values: (52, 61, 46, 38, 33, 76, 14, 17, 35, 21). Assume that the tree i… . . .