a) Explain with a suitable example why B+ Trees are considered as balanced? b) Consider a B Tree used as an index that has THREE levels including the root node. If a new key is inserted in this index,...

a) Explain with a suitable example why B+ Trees are considered as balanced?
b) Consider a B Tree used as an index that has THREE levels including the root node. If a new
key is inserted in this index, then what shall be the maximum number of nodes? Explain your
answer with an example.
c) Clustering index is defined on the ordered fields but not Keys, why? Explain with example.
d) How performance suffers due to poor indexing? Explain using Example.