In this exercise, we will examine how replacement policies impact miss rate. Assume a $2-$way set associative cache with $4$ 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.$

$[5]$$$5\mathrm{.}4,5\mathrm{.}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?