Consider the case of a 4x8 two-dimensional array of numbers, A. Assume that each number in the array occupies one word and that the array elements are stored column-major order in the main memory from location 1000 to location 1031. The cache consists of eight blocks each consisting of just two words. Assume also that whenever needed, LRU replacement policy is used. We would like to examine the changes in the cache as the following sequence of requests for the array elements are made by the processor 2. if each of the following mapping techniques is used a. b. c. Direct Mapping; Fully Associative Mapping; Set-Associative Mapping (With Two Blocks per Set). Consider the case of a 4x8 two-dimensional array of numbers, A. Assume that each number in the array occupies one word and that the array elements are stored column-major order in the main memory from location 1000 to location 1031. The cache consists of eight blocks each consisting of just two words. Assume also that whenever needed, LRU replacement policy is used. We would like to examine the changes in the cache as the following sequence of requests for the array elements are made by the processor 2. if each of the following mapping techniques is used a. b. c. Direct Mapping; Fully Associative Mapping; Set-Associative Mapping (With Two Blocks per Set)