Suppose we store the pointer $($or starting address of a record$)$ in a page by using the offset to the

beginning of the page $($i$.$e$.,$ the first byte in a page has an offset of $0,$ the $2$nd byte in a page has an

offset of $1,$ and so on and so forth$).$ Each slot entry is of the format: $($record offset, record length$)$

and we use $(-1,-1)$ to denote unoccupied slot. Consider the slotted data page organization instance

below, where we store the offset to the free space at the end of the page, the number of slots in the

slot array to its left, the slot array to the left of the number of slots $($growing backwards$).$ Assume

that we perform eager compaction if there is a hole in the occupied space, and all record payloads

after the hole are moved to lower offsets to fill the hole