Illustrate insertion sort algorithm on the following data.

31, 12, 15, 0, 40, 7, 16, 2

show the steps in details. write down the data position after every step. also write down the explanation in the side. maintain a column to find out no. of logical comparisons needed in each step. finally give the runtime in terms of total no of comparisons.

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?