Assume a Table has 100,000 Data Record/rows and each Data Record/row occupies 100 bytes. Disk pages are 4000 bytes and the worst case time to access a page is D = 20ms. Estimate the average case time of doing an equality search on a candidate key under the following conditions An unclustered B Tree Index in which each Data Entry K* occupies 20 bytes and assume 75% occupancy Root 13 1724 30 Height of this B+Tree is 1 2 3 5 1416 19 20 22 24 27 29 334 3839* COST = Height of the B+ Tree + 1 = log FN + 1 = log N/ log F + 1 F = # pointers index page or fanout F-3 N = # Leaf (Data Entries k*) Pages N = 5