Consider relations a and b. relation a represents the entity on the ""one side"" of a one-to-many relationship; relation b represents the entity on the ""many side"" of the one-to-many relationship. the delete rule between relations a and b is restrict. if an attempt is made to delete a record in relation a and its primary key value appears as a foreign key value in one or more records of relation b

Acomputer has a two-level cache. suppose that 60% of the memory references hit on the first level cache, 35% hit on the second level, and 5% miss. the access times are 5 nsec, 15 nsec, and 60 nsec, respectively, where the times for the level 2 cache and memory start counting at the moment it is known that they are needed (e. g., a level 2 cache access does not even start until the level 1 cache miss occurs). what is the average access time?