Please complete in C

Overview In this assignment, you will be implementing a cache. Your cache must support first$-$in$-$firstout $($FIFO$),$ least$-$recentFunctionality

Your new cacher should take two command line arguments, size$-$the size of your cache$-$policy$-$the policy your cach$\backslash$begin$\{$tabular$\}\{|$l$|$c$|\}$

$\backslash$hline & stdout $\backslash \backslash$

$\backslash$hline Cache Hit & HIT $\backslash (\backslash$backslash $\backslash$mathrm$\{$n$\}\backslash )\backslash \backslash$

$\backslash$hline Cache Miss & MISSThis example focuses on cache usage for policy flag $\backslash (-\backslash$mathrm$\{$F$\}\backslash )$ when $\backslash (\backslash$mathrm$\{$N$\}=3\backslash ).$ The row of the table includes

Hide image transcript

Overview In this assignment, you will be implementing a cache. Your cache must support first$-$in$-$firstout $($FIFO$),$ least$-$recently$-$used $($LRU$),$ and clock eviction policies. Your program should continuously take items from stdin until stdin is closed. After each lookup, your program should print to stdout specifying whether the item that was accessed is a HIT or MISS $.$ If the lookup was a miss, your cache will add the item to its cache and evict an item based on the eviction policy that the user specified. Before your program exits, and after stdin is closed, you must include a summary line that specifies the total number of compulsory and capacity misses.