Q5.1 Linear Hashing 3 Points Does linear hashing always split the bucket that overflows? O Yes O No Q5.2 Linear Hashing 3 Points What is the value (in binary) of next pointer? Make sure that you write the required number of bits in the representation. Enter your answer here Q5.3 Linear Hashing 3 Points What is the largest new key (in decimal) less than 25 whose insertion cause a split? The new key is different from the given ones. Enter your answer here Q5.4 Extendible Hashing 3 Points What is the global depth? Enter your answer here Q5.5 Extendible Hashing 3 Points Do all data buckets have a local depth of 2? O Yes O No Q5.6 Extendible Hashing 3 Points What is the largest new key (in decimal) less than 44 whose insertion cause the directory to double in size? The new key is different from the given ones. Enter your answer here