b$.$ Complete the columns Replace? $,$ Hit$/$Miss $,$ Tag of Block $0,$ and Bloc of Tag $1$ for the following computed tag and set values of a $2-$way Set associative cache organization assuming initially all blocks of the cache memory are invalid $($empty$).2-$way Set associative cache and assuming the replacement policy always replaces the oldest block.

$\backslash$table$[[$Tag$,$Set,$\backslash$table$[[$Tag of$],[$Block $0]],\backslash$table$[[$Tag of$],[$Block $1]],$Offset,Replace?,Hit$/$Miss$],[2,0,,,4,,],[4,1,,,6,,],[6,1,,,8,,],[4,0,,,8,,],[2,0,,,12,,],[10,0,,,7,,],[12,1,,,2,,],[18,1,,,6,,],[8,2,,,4,,],[8,2,,,6,,]]$