How to know the min number of records if a B+ tree of order 512, and leaf nodes with up to 32 records if the height was 6, and is there a general formula for such problems?