There is a $128$ byte, $2$ way set associative cache where each each cache block

contains $16$ bytes on a $16-$bit processor with $2^16$ addressable bytes of memory. ASsume that the cache: initially empty $($all valid bits are zero$).$ suppose we are accessing the memory adresses in the order of$.$

$00010,0$x$0032,00075,00098,00035,0$x$0027,0$x$0056,0$x$004$F

$.$

How many blocks are replaced?

A$.3$

B$.2$

C$.0$

D$.1$