B+ trees in DBMS plays an important role in supporting equality and range search. Construct a B+ tree. Suppose each node can hold up to 4 pointers and 3 keys. Insert the following 10 keys (in order from left to right): 1, 3, 5, 7, 9, 2, 4, 6, 8, 10 After the insertions, which of the following key pairs resides in the same leaf node? O 2, 3

= Suppose that we have a B and the size of the search key field V is equal to 10 bytes, the size of the data (record) pointer Pr 6 bytes, and the tree (block) pointer P is 5 bytes and the value of p (the order or the maximum number of a tree pointers in a node) is equal to 20 for an internal node. a) Calculate the block size (B) b) Suppose that we have a B- tree instead of B and based on the block size found in question (a), calculate the order (p) for an internal node in this case.

B+ trees in DBMS plays an important role in supporting equality and range search. Construct a B+ tree. Suppose each node can hold up to 4 pointers and 3 keys. Insert the following 10 keys (in order from left to right): 1, 3, 5, 7, 9, 2, 4, 6, 8, 10 After the insertions, which of the following key pairs resides in the same leaf node?  Refer to the previous question. How many pointers (parent-to-child and sibling-to-sibling) do you chase to find all keys between 4 and 7?

Course: Data Structure and Algorithms Language: Java Topic: AVL Tree Kindly solve this question prperly step by step and complete.   AVL Tree basics Draw the AVL tree after performing each of the following operations consecutively on an initially empty binary search tree: insert 8, insert 6, insert 12, insert 3, insert 10, insert 9, delete 12, delete 8, insert 7, insert 8.  If you delete an item from an AVL tree and then insert it back into the tree, will you always get back the original AVL tree? Justify your answer.

Please show work C++