A byte-addressable computer has a small data cache capable of holding 32 4-byte words. Show the name of each address field and the number of bits in each of the main-memory address fields associated with this cache if the cache is 4-way set associative and the blocksize is one word per block. Assume that main memory is capable of holding 214 words. How many individual tag bits need to be examined when searching fo a particular block in the cache from Part (c)? How many would need to be examined if the same cache were direct-mapped? Fully-associative? I am looking for three separate answers!