4. A Table in a relat ional database cont ains 100,000 Data Records/rows, each of which Data Record/row requires 200 bytes. A SELECT stat ement ret urns al I Dat a Records/rows in the Table that sat isfy an equal ity search on an attribute. Estimate the time in milliseconds to conplete the query when each of the fol lowing Indexes on that attribute is used. Assume a Page size of 4K bytes or 4,000 bytes and a Pap access time of D = 20ms. Est imate the time in milliseconds to insert a new Dat a Record/row in to the Table of Exercise 4. when each of the following Indexes is used: a. Index (Sorted File of Data Records) b. A Static Hash Index (no overf low buckets/Pages). Assume the cost o H, negl igible. f applying the hash funct ion is Static Hashing it Buckets Hash Computation c. A clustered requi red) sparse, unintegrated B* Tree Index (with no node splitting Root 13172430 2 3 57 4 19 20 22 42729 3343 39 4. A Table in a relat ional database cont ains 100,000 Data Records/rows, each of which Data Record/row requires 200 bytes. A SELECT stat ement ret urns al I Dat a Records/rows in the Table that sat isfy an equal ity search on an attribute. Estimate the time in milliseconds to conplete the query when each of the fol lowing Indexes on that attribute is used. Assume a Page size of 4K bytes or 4,000 bytes and a Pap access time of D = 20ms. Est imate the time in milliseconds to insert a new Dat a Record/row in to the Table of Exercise 4. when each of the following Indexes is used: a. Index (Sorted File of Data Records) b. A Static Hash Index (no overf low buckets/Pages). Assume the cost o H, negl igible. f applying the hash funct ion is Static Hashing it Buckets Hash Computation c. A clustered requi red) sparse, unintegrated B* Tree Index (with no node splitting Root 13172430 2 3 57 4 19 20 22 42729 3343 39