Consider a Search with Equality Selection. For an Unclustered Hash Index File organizations, what is the cost 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 Data Record when the Page is in memory, H cost for Hash (assume no overflow Pages), Hash Index 80% occupancy (thus the number of Pages is 1.25B). Data Entries k* are 10% the size of Data Records. File Organization Heap Sorted Unclustered BTree Index Search cost Unc lustered Hash Index