================

C programming problem.

Read carefully and Only full answers will get positive rated. Thank you.

In this assignment, you would implement is some kind of a fully associative cache. Which means, any block can hold any place in memory or cache. And on your implemented cache, you have to apply 2 cache replacement policy there: MRU(most recently used) and LRU(least recently used) At the end of all the input, you have to print The miss-rate: total_miss/total_request The hit-rate: total_hit/total_request Average access time. Assume that average cache access time is 1 n anosecond average memory access time 100 nanosecond and average disk access time is 100000 nanosecond You need to incorporate this kind of mechanism using c code