hi dear

i have these quesions and i need the solution please cuz i cant slove it alone

.Question One

A file has r=30,000 EMPLOYEE records of fixed-length

Consider a disk with block size B=512 bytes. A block pointer is P=6 bytes long and a record pointer is P R =7 bytes long. Each record has the following fields: NAME (30 bytes), SSN (9 bytes), DEPARTMENTCODE (9 bytes), ADDRESS (40 bytes), PHONE (9 bytes), BIRTHDATE (8 bytes), SEX (1 byte), JOBCODE (4 bytes), SALARY (4 bytes, real number). An additional byte is used as a deletion marker.

Calculate the record size R in bytes.

Calculate the blocking factor bfr and the number of file blocks b assuming an

unspanned organization.

C. Suppose the file is ordered by the key field SSN and we want to construct a primary

index on SSN. Calculate the index blocking factor bfr i .

QUESTION 2

Based on the B+tree in the Figure below, where the maximum capacity of the node is 4 and the minimum is 2. What happens if R is deleted. redraw the results.

D R Y X R F E D c B