For the problem below, there is a fully associative cache with 4-word blocks and a total size of 4 blocks. Use LRU Replacement.

I. Explain how a 32-bit byte address should be divided into Tag and Offset fields.

II. For each address in the byte address sequence, fill the table below to specify the Tag, Hit/Miss, and whether a replacement will be triggered. The cache is initially empty. Use Hex for the Index and Tag. The LRU List column should list all blocks in the cache represented by their tags from most recent to least. Provide an explanation of your steps.

Address	Tag	Hit/Miss	Replacement? (Y/N)	LRU List
0x20038
0x20015
0x20038
0x20016
0x1A054
0x1B338
0x1B33F
0x20038
0x20113