In a relational database with a key field. A non-leaf order of B tree is 20 used as an access structure on the key fields. The key field is 8 bytes long, the disk block size is 2y bytes, each data pointer is 12 B bytes long and each block pointer is 4 bytes long. In order for each B-tree node to fit in a single disk block the minimum value of y is _____