In this exercise, we will examine how replacement policies affect miss rate. assume a two-way set associative cache with four one-word blocks. consider the following word address sequence: 0, 1, 2, 3, 4, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4, 5, 6, 7, 0. consider the following address sequence: 0, 2, 4, 8, 10, 12, 14, 16, 05.20.1 [5] < §§5.4, 5.8> assuming an lru replacement policy, which accesses are hits? 5.20.2 [5] < §§5.4, 5.8> assuming an mru (most recently used) replacement policy, which accesses are hits? 5.20.3 [5] < §§5.4, 5.8> simulate a random replacement policy by flipping a coin. for example, "heads" means to evict the first block in a set and "tails" means to evict the second block in a set. how many hits does this address sequence exhibit? 5.20.4 [10] < §§5.4, 5.8> describe an optimal replacement policy for this sequence. which accesses are hits using this policy? 5.20.5 [10] < §§5.4, 5.8> describe why it is difficult to implement a cache replacement policy that is optimal for all address sequences. 5.20.6 [10] < §§5.4, 5.8> assume you could make a decision upon each memory reference whether or not you want the requested address to be cached. what effect could this have on miss rate?