2. (10 pts) Assume a Table has 100,000 Data Record/ro and each Data Record/row 100 bytes. Disk pages are 4000 bytes and the worst case time to is D 20ms. access a page under the timate the average case time of doing an equality search on a candidate key following conditions. a) An (unsorted) Heap File of Data Records with no Index. Transcript File Stored as a Heap File CrsCode sem Grade 666666 MGT123 F1994 4.0 23456 CS305 S1996 4.0 Page 0 987654 CS305 F1995 2.0 71717l CS315. S1997 4.0 666666 EE10 S1998 3.0 page 765432 MAT123 S1996 2.0 51515 EE10 F1995 3.0 234567 CS305 S1999 4.0 page 2 878787 MGT123 S1996 3.0 ANSWER b) An unclustered Br Tree Index in which each Data Entry K occupies 20 bytes Height of this B+Tree is 1