------------------------------------------------------

C programming coding problem.

It seems long but not. most parts are introductive steps.

Please read carefully and ONLY FULL ANSWERS will get positive rate.

Thank you.

you have to implement something like set associative cache. For your convenience, just think your cache is 2-way set associative. 1. So your first task would be to implement 2 way set associative cache. To find the set for any block, assume that disk-block-number % cache-size. 2. Now, assume that, each of the blocks in your code, is 16 byte. And the total size of your cache is 512 bytes. That means, your cache has in total 512/(16*2) 16 entries (Note that those value would be customized, you should have the ability to give those entry. In case of 2 way set associative, each of the entry can hold 2 blocks). For the second task, consider the following code: int x[2][128] int i int sum 0; for(i-0; i