6.B+ Trees a) Design a B+-tree to store an index assuming That the block size is 8K and one tree node is stored in one block That an index entry consists of a single key that takes (Use a value in (10,,20)) Bytes of storage and the index pointer that takes(use 4 or 8) Bytes of storage What is the maximum number of keys that can be stored in a node? b) Based on your answer to question a, how many index entries does a B+-tree of height 3 store at an average. (Hint: assume that each node of your B+-tree is (use a value in (0.6,,0.7)) full, and compute the number of entries based on your assumptions).