An order d=23 B+ tree with fill factor 31% can contain nodes with up to how many pointers?
1) An order d=23 B+ tree with fill factor 31% can contain nodes with up to how many pointers? a) 24b) 31c) 47d) 60
2) What do the inner nodes in a B+ tree index contain?
a) Records
b) Non-Deleted Keys
c)Non-Deleted and Deleted Keys
d) Values
e) Tables
Note: correct answer will receive 5 stars!