True or False for a B-tree of order m containing n items: The height of the B-tree is O(logmn) and this bounds the total number of disk sets.