2. Bubble sort algorithm is used for sorting N integers, where N is 1024. Cache at L1 level is 2
way associative, with block size of 16 bytes and total size of 1024 bytes. Given an integer
requires 4 bytes, show the cache hit and miss pattern for array accesses.
3 For the question 2, find the total number of hits and misses at L1 cache level.