1. 5pt]Inimplementing a buffer poolmanager, it is betterto make independent amays for the frames and for the frame descriptors. Why Why not have a data-structurethat combines a frame andits descriptor-say, a frame cell-andjust have an aray offrame cells? or-3av, a frame cell-andiust have an arrav cells! 2. 7pt]Consider the data values giraffe (29), capybara (17),badger(5),impala(41), elephant (13), aardvark (21), hedgehog(29), donkey(25), and fox (33). (The number a fter eachrepresents its hashvalue using thehash functionh.) Consider a B+tree index of order two (so each node holds up to four entries). Showhowthe B+tree indexwouldlookafter adding the nine entries fromabove (giraffe, etc.) in thatorder. 4 (10pt) Index Logic. That docsn't make sease Comsider the following schea Employee(el.name, salary.dw FK (d#) reb. Department Department (d # , name, location, budget ) Project (dtitle, budget, leader) FK (d) ref Departwment FK (leader) res Employee (ew Dr. Day he has made the following indexe on the above seheaaa -Employee A. uneustered hash inlex on ew. name B. chastereed tree index on dw.salary -Department D. unelustered tree inlex on name, location - Project E. chistered tree index on dw. title F. clitered hash index oa leader (a) [6pt] You do not trust what Dr. Dochurry has sai aot the indeses. There are logical (Thst issnother index wonld be impossibilit, anel inddeoe that do not e se better in every situation than that one) klentity at let three of these problens (b) Apt An index is usally created by the system when a primary key is declared for a table. The reason is that integrity checking would be too expensive without an index Consider a table like Employee with a one-field key e, what type of index would be more appropriate for this? Who? What if the primary key were composite consisting of multiple fiekds such as title. year, studio for a table, say. Movie 1. 5pt]Inimplementing a buffer poolmanager, it is betterto make independent amays for the frames and for the frame descriptors. Why Why not have a data-structurethat combines a frame andits descriptor-say, a frame cell-andjust have an aray offrame cells? or-3av, a frame cell-andiust have an arrav cells! 2. 7pt]Consider the data values giraffe (29), capybara (17),badger(5),impala(41), elephant (13), aardvark (21), hedgehog(29), donkey(25), and fox (33). (The number a fter eachrepresents its hashvalue using thehash functionh.) Consider a B+tree index of order two (so each node holds up to four entries). Showhowthe B+tree indexwouldlookafter adding the nine entries fromabove (giraffe, etc.) in thatorder. 4 (10pt) Index Logic. That docsn't make sease Comsider the following schea Employee(el.name, salary.dw FK (d#) reb. Department Department (d # , name, location, budget ) Project (dtitle, budget, leader) FK (d) ref Departwment FK (leader) res Employee (ew Dr. Day he has made the following indexe on the above seheaaa -Employee A. uneustered hash inlex on ew. name B. chastereed tree index on dw.salary -Department D. unelustered tree inlex on name, location - Project E. chistered tree index on dw. title F. clitered hash index oa leader (a) [6pt] You do not trust what Dr. Dochurry has sai aot the indeses. There are logical (Thst issnother index wonld be impossibilit, anel inddeoe that do not e se better in every situation than that one) klentity at let three of these problens (b) Apt An index is usally created by the system when a primary key is declared for a table. The reason is that integrity checking would be too expensive without an index Consider a table like Employee with a one-field key e, what type of index would be more appropriate for this? Who? What if the primary key were composite consisting of multiple fiekds such as title. year, studio for a table, say. Movie