For these problems, we will use word addresses, which are memory addresses but without the last two bits. For example, for the 64-bit address 000....0101000, its word address is 000....01010. We will refer to word addresses as references. As an example, the following shows addresses and their references

Address	Reference (word address)
0	0
4	1
8	2
12	3
etc	...

Hint: To simplify the mapping of references to cache entries, construct a table as shown below. The table is for a direct mapped cache with one-word blocks and a total size of 4 words.

Cache Index	References
0	0, 4, 8, ...
1	1, 5, 9, ...
2	2, 6, 10, ...
3	3, 7, 11, ...

The following problems are for particular caches. They all refer to the series of references: 2, 3, 11, 16, 21, 13, 64, 48, 19, 11, 3, 22, 4, 27, 6, and 11. You are to determine if a reference is a HIT or MISS assuming the cache is initially empty. You also determine the final contents of the cache, which are the final references stored in the cache.

1. Assume a direct-mapped cache with 8 one-word blocks. In the table below, indicate if the reference is a HIT (Y for yes, N for no)

Ref	2	3	11	16	21	13	64	48	19	11	3	22	4	27	6	11
HIT?

Show the final contents of the cache in the table below:

Index	Contents (the refs)
0
1
2
3
4
5
6
7