The table Student$($ID$,$ email, name, address, telephone$)$ has a B$+$ tree index on the

telephone number. Each node of the B$+$ tree stores $16$ index key values and all the

leaf nodes of the index tree are direct children of the root node. To find the record

with a given telephone number, maximally how many comparisons are needed to

find the location of the page where the record is stored? If the index fits in two

pages, how many pages must be read for the record to be retrieved? Choose the

correct answer combination $($only one$)$ for both questions. Answers are separated

by $\text{'}$;$\text{'}$;

a$.8$;$3$

b$.32$;$3$

c$.8$;$2$

d$.16$;$2$

e$.32$;$1$

f$.16$;$1$

g$.32$;$2$

h$.8$;$1$

i$.,16$;$3$The table Student$($ID$,$ email, name, address, telephone$)$ has a B$+$ tree index on the telephone number. Each node of the B$+$ tree stores $16$ index key values and all the leaf nodes of the index tree are direct children of the root node. To find the record with a given telephone number, maximally how many comparisons are needed to find the location of the page where the record is stored? If the index fits in two pages, how many pages must be read for the record to be retrieved? Choose the correct answer combination $($only one$)$ for both questions. Answers are separated by $\text{'}$;$\text{'}.$