Working with a $2-$way set associative cache that has the following configuration:

Number of sets: $4$

Memory address length: $8$

Words per block: $8$

Task:

Draw the Initial Cache Layout:

Create a diagram to represent the initial layout of the cache memory. Set index for the sets ID and word ID$,$ and leave blocks for the tag.

Dynamic Data Insertion:

For a series of data with given memory addresses, simulate the process of inserting this data into the cache. Calculate the set index for each memory address to determine the appropriate set for each data piece. Update your cache layout diagram to reflect the result of all data has been inserted.

Given Binary Memory Addresses:

Data A: Address $00010010$

Data B: Address $01000100$

Data C: Address $00011010$

Data D: Address $10001110$

Data E: Address $00110010$

Data F: Address $00001100$

Data G: Address $00000110$

Data H: Address $01010100$

Data I: Address $00011110$

Data J: Address $00110110$

Data K: Address $01011110$

Identify the first data that requires a replacement before it can be put into cache.