Consider a DBMS buffer cache that can store four blocks. The buffer cache uses a LRU strategy which is implemented as a queue. In the beginning, the cache is empty. The blocks a, b, c, d, e, f and g are read in the following order:

a; c; e; g; e; a; f; d; e; b; f

In the table below, state the contents of the buffer cache after each block is read in the eviction order from right to left, i.e. the first entry to be evicted should be on the right. Example: adding e to abcd means that d will be evicted.

Please note that your answers should not include upper case letters or spaces. You get 0.5 points for each correct answer.

The contents of the buffer after reading the first three blocks are already given.