Insert the following keys sequentially into an extensible hash structure using the Hash Function h(key) = (sum of the digits of the key) mod 6 . Assume each bucket can hold at most 2 records. [5] Search Keys: 44, 98, 79, 57, 69, 85, 39

Consider the following schedule where 5 transactions are operating concurrently:

T1 T2 T3 T4 T5 - - - read(C) - - read(B) - - - - - read(A) - - - - - write(C) - - write(B) - - - - - write(A) - - - - - - read(C) - - - read(B) - - - - - read(B) - - - - write(C) read(C) - - - - - read(A) - - - - - - - write(B) write(B) - - - - - write(A) - - - - - - read(A) write(C) - - - - - - - - write(A) i) Draw the precedence graph from the given schedule. [3] ii) Is the schedule serializable? If yes then show an equivalent serial schedule.