level =0,N0=4, next =0 00 01\begin{tabular}{|l|l|l|l|l|l|l|l|l|} \hline 9 & 25 & 5 & \\ \hline 10 & & & \\ \hline \end{tabular} 11 Assume that a bucket split is triggered whenever some bucket overflows. (a) What is the maximum number of data entries that can be inserted (given the best possible distribution of keys) before you have to split a bucket? Explain very briefly. (b) Show the file after inserting a single record whose insertion causes a bucket split. (c) Consider the original Lincar Hashing index shown. (i) What is the minimum number of record insertions that will cause a split of all four buckets? Explain very briefly. (ii) What is the value of next after making these insertions? (iii) What can you say about the number of pages in the fourth bucket shown after this series of record insertions