Suppose a program makes a sequence of memory references that cause the following memory blocks to be read, in this order: A, B, D, E, A, C, E, A, C, B, E, A. The CPUs cache has 4 blocks and uses FIFO as the replacement policy. Show the state of the cache after each memory block access. Assume the left-hand side of the queue is the head of the queue. Use an arrow to mark the oldest block in the queue.