S20Ihisexercie we will camine how replacement polckesaffect ms 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, 0 ment policy, whi are hits? 5.20.2 [5] Assuming an MRU (most recently used) replacement policy, which accesses are hits? 5.20.3 [5]SS5.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