Question

The Least llecently und Kru)
CACHE Algorithem wiere the
element flom the CACHE
when at u full that was
least recently wed. after elerronn
hun requised to CACHE Rronbuld be added
h CACHE Care not already there
and consideradmost event werd
clement CACHE give the Madimum.
ize JCACHE sea er opintigne
The qristeAACHIC callloll bes.
number of CACHEnides wirg
e
2 oru ang CACHE Algolithem.
CACHE misses durs when the
required anregar Dout not in
CACHE. Innicelly or empry. program​

Answer 1

Answer:

plz tell right ques

Explanation:

Answer 2

noob + noob =

give me answer