Suppose the search key of a B tree is V=8 byte long, the disk block size is B=512 bytes, a record(data) pointer is P=6 bytes and a block pointer is l=5 bytes. Calculate the order of the B tree and also  is each node of B tree is 69 percent full. Find the average number of keys per node of the above B tree.