Problem 2 ( 25 points) Given a byte-addressed memory with 12 -bit addresses, and an attached four-way set associate cache with a total of 16 one-word blocks, make a table showing the final state of the cache after accessing the following memory addresses. The table should include the tags and data that will be stored in cache at the end of all insertions. Data should be shown using the corresponding addresses in main memory, as in Section 5.4 of the textbook. Use the least-recently-used rule to evict from cache as needed. The sequence of addresses accessed is: 0143,0c4a,022b,042f,0492,02a2,03ba,0b2d