For the following access pattern, indicate if each access is a hit or miss. Assume that the cache has 2 sets and is 2-way set-associative. Assume that block A maps to set 0, B to set 1, C to set 0, D to set 1, E to set 0, F to set 1. Assume an LRU replacement policy.

Does the hit rate improve if you assume a fully-associative cache of the same size (again, indicate if each access is a hit or a miss)?

Access pattern: ABCBABECAFDBCAF