When using B+ trees O true Ofalse - disk pages should be organized as a collection of subtrees O true Ofalse-each leaf node is linked to the next node in the list O true Ofalse - each non-leaf node contains pointers and index values only O true Ofalse- at each non-leap node the number of pointers should equal the number of values