Problem 5: Classifying Misses (20 points) Consider a 2-way set-associative 8B cache for an 8-bit system. Each block is 2 bytes and an LRU eviction policy is used. Given the following sequence of cache accesses, determine whether each access is a hit or a miss and then classify each of the misses as one of compulsory, capacity, or conflict. Additionally, break down each address to show the tag in order to help see what is in the cache. Please follow the format of the first row (which is filled out for you).

Problem 5: Classifying Misses (20 points) Consider a 2-way set-associative 8B cache for an 8-bit system. Each block is 2 bytes and an LRU eviction policy is used. Given the following sequence of cache accesses, determine whether each access is a hit or a miss and then classify each of the misses as one of compulsory, capacity, or conflict. Additionally, break down each address to show the tag in order to help see what is in the cache Please follow the format of the first row (which is filled out for you) Conflict Address Tag 0x16 0x03 0x14 0x34 0x15 0x26 0x35 0x27 0x06 0x01 0x09 Hit/Miss CompulsoryCapacity 0x5 Miss