1. Consider a two-way set associative cache that divides addresses into the following fields

Tag with 4 bits set-number with 2 bits

offset-number with 2 bits a. determine the number of address bits, the number of lines, the number of data bytes in the cache, and total cache size in bits b. Write a cache history table to show the cache use for the following list of addresses, in order. Assume that the cache initially is empty. For each address indicate if a cache 'miss' or 'hit' occurred and indicate the tag value assigned to each cache line. Assume the use of least recently used (LRU) replacement policy. $29, $a3, $6d, $46, $58, $24, $2a, $7B

2. Consider a system with 10 bit addresses and a two-way set associative cache with four sets and 16 bytes of data stored per line. Assume that the cache is initially empty. Consider the following address requests. a. First illustrate how the address is divided and has a tag field, set field, and offset field. Indicate the number of bits in each field. b. Calculate the data memory size in bytes as well as the total bits used to represent the set data, valid bits, and tags. c. Write a cache history table to show the cache use for the following list of addresses, in order. Assume that the cache initially is empty. For each address indicate if a cache 'miss' or 'hit' occurred and indicate the tag value assigned to each cache line. Assume the use of least recently used (LRU) replacement policy. $151, $183, $2B2, $0C5, $154, $187, $258, $306