Consider a B tree with Order P where Order P is between 2 to P child poniterscan store in root and between (ceil(P)/2) to P child pointers can store in oter nodes of B tree index. The maximum levels of index required to store 300 distinct keys in Order(P)= 5 B tree index_____.
