Consider an extendible hashing scheme where the bucket capacity is 2 and the initial local and global depth are 0. Assuming LSB (least-significant bit) to be checked to find the directory for a record, insert the following data in the hash table. Show all the necessary steps while inserting. Pointer Key_value Hash(key_value) Pointer 1 2456 18 Pointer 2 7854 6 Pointer 3 3256 20 Pointer 4 8569 3 Pointer 5 4123 14 Pointer 6 8965 2 Pointer 7 5214 8 Pointer 8 7536 22