Calculate the order of leaf ($P_{leaf}$) and non leaf (P) nodes of a $B^{+}$ tree based on the information given below.
Search key field = $12$ field
Record pointer = $10$ bytes
Block pointer = $8$ bytes
Block size = $1$KB
- $P_{leaf}$ = 51 & p = 46
- $P_{leaf}$ = 47 & p = 52
- $P_{leaf}$ = 46 & p = 51
- $P_{leaf}$ = 52 & p = 47