Big Data Analytics Please complete all the questions and you will get a Please use your own work, can't copy 4. In the extensible hash index (each bucket can hold at most 2 items) below, if we want to insert 19, what will be the structure of the hash index after the insertion? [20 points] 16 20 h(1) -00001 h(2) -00010 h(3)00011 h(7)00111 h(1 6) 1 0000 h(18)-10010 h(19) 10011 h(20) 10100 01 10 Directory Buckets 5. Assuming that the node capacity of B'-trees is 4, please draw the updated B trees upon insertions. [25 points] 5(a). Insert tuples with key 23* into the following B'-tree. [10 points] Root 14 19 2433 57*14*16* 19 20 22 24 27 29* 33 34 38*39* (b) Insert tuples with key 8* into the following B'-tree. [15 points] Root 14 19 24 33 2 357 14* 16* 19* 20 22 24 27* 29* 33 34 38* 39*