An intermediate node of a Bt-tree

1 B+-Tree File Organization
Consider a relation R with 48,000 records. This relation has 4 attributes. The sizes of each attribute are: 6 bytes, 12 bytes, 4 bytes, and 18 bytes, respectively. The first attribute is the primary key. We wish to store R as a Be-Tree file on the disk, using the primary key of It as the search key. The size of a pointer is 4 bytes. Each block (i.e., page) is 512 bytes. [Flint: Since we have a Be-tree file organization, what do the leaves of the tree contain? The actual records of R, or pointers to records of 11?)
1.1 What are the maximum number of keys, and the maximum number of pointers (n), that an intermediate node of this Be-tree can have? (5 points)
1.2 What is the minimum number of pointers, allowed in an intermediate node of this Bt-tree? (5 points)