let order n
n*6+(n-1)*9<=512
n=34 ,Level 3 B+ tree ,so Levels: 0,1,2,3
Root: node=1, key=34-1=33 , child ptr=34
Level1: node=34, key=34*33 , child ptr=34*34
Level2: node=34*34, key=34*34*33 , child ptr=34*34*34
Level3: node=34*34*34, key=34*34*34*33 ,child ptr=0(as leaf node), block ptr=1
since in B+ tree actual entries are stored in leaf nodes hence max entries will be 34*34*34*33 (A)
i am getting this...