(a) For the B+ tree in Figure 1, a. What is n? b. How many values can be stored in non-leaf nodes? c. Would a new value fit into one of the existing leaf nodes? d. In which block would the value "Frederick" be stored? e. In which block would the value "Arbutus" be stored? Block 1 Perryridge Block 2 Block 3 Brighton Downtown Mianus Perryridge Redwood Round Hill Figure:1 (b) Discuss the properties of B+ tree? (c) Consider constructing a B+-tree of order 4 (i.e., n = 4, each index node can hold n-1 keys and n pointers). Show the resulting tree step by step after inserting keys in this order: 1, 3, 5, 7, 9, 2, 4, 6, 8, 10 (d) Discuss the disadvantages of using Static Hashing in database