please show me the steps to solving this

6. Use the following two digits customer numbers to construct an indexed sequential file assuming 4 records per track in the prime area. (5, 14, 19, 23, 29, 31, 45, 55, 69, 71, 85) Then, insert the following customer numbers according to first come first inserting rule (52, 98, 54, 97 and 84). 7. Construct a 3 key values per node B+ tree for the following customer numbers according to first come first inserting rule. (46, 50, 42, 62, 16, 56, 31, 40, 59, 20, 30, 89, 37, 19, 39, 21) no ! Sdt tot 251bbon Then, delete the following customer numbers according to first come first deleting rule (42, 62). ODOTUDIO MD2D 22 6. Use the following two digits customer numbers to construct an indexed sequential file assuming 4 records per track in the prime area. (5, 14, 19, 23, 29, 31, 45, 55, 69, 71, 85) Then, insert the following customer numbers according to first come first inserting rule (52, 98, 54, 97 and 84). 7. Construct a 3 key values per node B+ tree for the following customer numbers according to first come first inserting rule. (46, 50, 42, 62, 16, 56, 31, 40, 59, 20, 30, 89, 37, 19, 39, 21) no ! Sdt tot 251bbon Then, delete the following customer numbers according to first come first deleting rule (42, 62). ODOTUDIO MD2D 22