Calculate the orderof leaf $$(P_{leaf})$$ and non leaf(p) nodes of a $$B^{+}$$ tree based on the information given below
Search keyfield = 12 bytes
Record pointer = 10 bytes
Biock pointer = 8 bytes
Block size = 1 KB

A

$$P_{leaf}=51$$ & $$p=46$$

B

$$P_{leaf}=47$$ & $$p=52$$

C

$$P_{leaf}=46$$ & $$p=51$$

D

$$P_{leaf}=52$$ & $$p=47$$