Which of the following statement is true for B tree and B+ tree index?
(a). B tree index is faster for range queries than B+ tree index.
(b). If disk block allocated for B+ tree index and the same size disk block is allocated for B tree index, then number of index blocks and I/O cost of B+ tree index is less than or equal to B tree index for given distinct keys.
(c). If disk block allocated for B+ tree index and the same size disk block is allocated for B tree index, then B tree index access cost is less than or equal to B+ tree for given distinct keys.
(d). If number of keys that can be stored in B tree and B+ tree index is same, then I/O cost of B+ tree index is less than or equal to I/O cost of B tree index for random access of same key from set of distinct keys.