solve this question from database management course in computer engineering.

Q5. Construct a B+-tree for the following set of key values: (2, 3, 5,7, 11,17, 19, 23, 29, 31) Assume that the tree is initially empty and values are added in pointers that will fit in one node is 6. For the B+-tree of (a), show the steps involved in the following queries: o Find records with a search-key value of 11 Find records with a search-key value between 4 and 23, inclusive Show the form of the tree after deleting key values 2, 3, and 5