Hi chegg! I need help on my ride. Plz show ur work

5. (20 pts) Average ANALYSIS Consider a Search with Equality Selection. F or each of the Heap, Sorted, Unclustered B Tree Index File, and Unclustered Hash Index File Organizations, what is the if exactly one Data Record qualifies i.e., the Search is on a candidate key? Assume B Pages, D cost per Page, R Data Records per Page, C cost per Da Record when the Page is in memory, B. Tree Index 67% occupancy (thus number of Pages is 1.5B), H cost for hash (assume no overflow Pages), Index 80% occupancy (thus the number of Pages is 1.258). Data Entries 10% the size of Data Records. File Organ i zation Heap Sor ted Unclustered BTree Index Search cost Unc lustered Hash Index YOU NEED TO JUSTIFY YOUR ANSWER in WRITING! NSWER