ONIT-1¥
—— O
Memory Mbnagernent Qo! Virtual Demory
lal ae oa
Logical Versus Phqsrcal Addie s< fp emeee
os ve ==
Logical Addres« hysrcal Address
SS = SSS=— S Pry x id
~The legical Adress 3 Physical Addvessis
i qwrt meted by located im CATO Trearer
pe: (CD Generated ey main
memory .
=>
The logical Addresa SP TLils Ure acti!
Is tthe fostructoo OAdvess 19 Lye ROID
OAAve =s. menrory,
= User coo Occes< => TL cas be
gical At rece accesced rect le.
Arectly.
=> Tk cas nok be Th canbe Glewsted
Calculated by Phystoxt 84 Logica! Deddrece.
A aAlesc
= legical Address t< => ae ae
also aalled as he stanly.
1
oes Adlavecs*
ae 3 : Se Dbit Qvarlable foth,
> TE not Oyeileble inthe me ero.@
= There ts nO => There fs aMenon:
+
Memory Marge nent Manore mest Or
MM
Onie-CM MU) er
eftrse a hasdwase.
= klhich maps -the legrens
AAA re, Anel Ph¢siot
ada Tess.
= The
set of loge! P The Sob Of Phacros)
Odd fees, FJerer~te) by AA vec, Corre sponplte
a PO Yer is Glled +o logtant Lace
Gao lege Nodta=: Spree Oled on
Space! " Physro! cublre ss
Space’.@
aeereg [sopping io poner ee axpereott
SS 88 SS =e
—_—
TL 0 process.
=> Tn tohrch procese CaM be tenrporetly
Sfp from mci memory Lo secondary
Memory,
> Th ts Used to i e main Menor4
Ut le Lion.
> The swapped Ob protece tg stored 10 O
Packs Culac see ae Secondary memory.
=> That [Place f< Called as ps =
=> The sping Te Used hen date, igrot
Present 19 Low,
=> Tb he lps to wus darger aad mose th=n on
Pro ces »
3 re ts ako called as "memory Compaclioo,
The Sepp ing fe olivided PEO Lazo Parts.
Ir Se2-p—Out-
d+ Sdap— IV@
{+ SDA Cue 5 ¥ ‘
EEERISE Te ts the processof verrony
oO process fron 72O oor One
adelng -to -the Seconclry mena
then tk t Called as Nodap-ont"
be SOeprn Tb ts Lhe proces: of seeming
m PrO Cece fron Secondary menett and
se? fie
adding +o -the main enero rg e Galles
as Sip — to" .
example :—
ode
rales
Pe cetingay che
po
process PAvo Loges Of Sreppr - @
SS Ser SS
+ Tk Supports mutltple processes Piaf srogle
mara poe A
t
¥ Th Crentesand uses Virtual eerory.
TL Troproves -Lhe main menor} ub Inz Hon,
Sy ee Sve S|
Disadvantegec of Soapping =
¥ Tf Lhe Computer ayster loses power Le
User TO 4 lose information.
* Tfhthre sdapping Lechnique fk MoE geod ther
T
§L cleerxeases Lhe Overall Procesrra
Performance oCorttguous Allocotion in Some a
a =S
Ss eS SSS SS
sory tO
=> The Process Of allocestrG i ae ¢
u
each Piocece fa colled as "memory AlloceLio0,
b. Voroble aRagi Bsa : ]
Rorkiion “J [Prey
DI Bol gquous enrenory allecerttog each procesc
1$ Coptatned | stored to Q Sle COU gon,
block Cf roemorn,.
Ge Pea aero tng wili-fired neptesck Cy eT) /
Fixed Pactition: = Memory ts Avice Ito Sven
SS
fined S¥ce Partitions cach, Patton Qntsion
(oa) 4 One process,
=PWhen Process ta Commpletedthen the peor
| '= free.@e
=k
Che tie Portthion ts freethen o process fs
Seleoted foo TOped
> Th,
© Free block of memory owe Called Ox
‘holes’
queue And loaded init
> There are tno Lypes of Pactrtions.
bb stale PaorliLos 2. Dyromie partion,
bsStatia (5 Petition 3—
SS SSS
ECE pe mmecory f= portriioned | Olvicled before.
the ereacdion then tits called as shake,
Parle foo!)
Qe Dy naene. Pawkitran 3
———
Tf, the memory ts. olivided ab eustime thes
TL fs ated as " Darcie Parkt-tios.BO @ ~
beMu prog aCrOG D1 Vasio’ le Seelno-of Lacks |
MVT)] Vartable partsHol i
a VT] ver pele ae
fable
Memory ts vile into Vowrable sf Paging fsa stor-ye technique.
PIE fe a non—comkiquous Allcatton Of mene ¢-
Prt 7s the Process of take the Processes
frown the seconde:
thems #0 the PAID
Fegfog.
Pr here Gre bvo main thieg: |. scconchr,
"T aad Onc! place
aaa *5 Called as
De ME Pa ,
=In conclory memory Process to AHviclep
into
0 'of Parttlions is aaiicd as ‘pages.
=> The sire of Sah; Page must be same feqeen/.
=> There kk a logical acletrese ancl the ye fsa
Degrat memory .
ID wmain ear Pe divided Pato No-af
i Y
PAEROS Ts Coiled ag frome,
=> The Size Cf each frie must be Same.
=> There is a Pb Address and ther is
QO physical memory -The te nm Q
w n (wo)
Poge table,
= Page Leable input te Page Qumbest anol
Page -Lable Out pat frame Number.
> In Paging Lechnteue The Size Of Page
fe 2ayptal to the size of frame.
=>
Pega,
fd Rrcete! Of logteat ana ph ston! memory
a
¥
Page no pLE™mEeno.
° J
!
% be] 2 Joutpak
2
Pygetetle
VID remo
fet Phesre.4 ~
wo Pyeo is eat leble atk frame
2Pyer 1 " ” rt coer
were U 7 " ty t
ore?" ur ” b Be.
ae"t
@
4 v Cd7 ardur
’ Ox
fot 2 t
re 3 Chot-sffo oD
a4
v >
47h pun,
al
|
4
i
aa
i
seep yy 172,24
Pogo:
—
4@
> The CPU gemermtes -Lhe Logic!
reac,
> The de gton Ade elvese ts ofvicted tobe L200
Psrte. Gay P9Yes CPge meunbers
& Fge ffsetCruber oF thris >.
= The process fs aivicted into parkftions
Ts Called as " Page’.
PLL Can be repre cented by" p!
— c— ok Vepreseots cue ber of
bree of Page:
=? Dk can, be Tepresented al “A”.
= TE& the fnshuctoo number.
2 Fege number Qre given-bo he Payze beable.
™ Page Eble Contains Bajenumber nal Piame
Trea ber-
DThe Page t=ble (opctts Page [um berancf
ctr rs femme mun ber.
= frome Number fs Gm brned walt Pageoffcel-
2D Man reemory Create the Physpony Aektress.\ @
Exannple e
=.=
by be pages.
Paging for B2—bybe mmennory ttt bya ®
J Poa -for Physical Odlltese i
= =—
— Se SS
Phastcal gare sex frome riumbor $size af Pag
+ Offset
COO Phasras OdAN ress &
= Page Shoes Viepename
Of Pye
OBfcct =o frome numbe r=
Peo = s¥y po MF Pyeng
= 20.
ab Phys cal acldeess sl trctrecctieo |
> ==
Offset =| frame ueber=s
Pegjeo Dans y +i Sr of Pyeny
=
CM @ phyrot adalees | rostreseteos 4
a ——
SS =
Prgenee| Premecumber=6
affse —O creo Pye=4.
Py Coed = 6x4 to °F@
" Zostectior(8> | phage adolress es Poges(1): +
SS SO
Page rumnber= Se of Pog
Off cek =O frame uber
Poet! adobe, Cron 1¥4 +0
= E
i Toskrsctroo neti? Ors) | Phgstod i Cp)? i
od
Pegenumber =4
Offa =a Prem
Premerunbe
Peye203)
= 24442
B72 sy
as fear "4 fer IG- byte as wih abt
Feges+ Cuce cyour Mae),@
TRnsiation Lock —asicle bufferCGLey
=—=— + Ne
on
Paste hardware GHA TLR
x * ===
— ES»,
PD A Trnsiation look cattle buffer can be
Aefinect as a menor Cache.
>Thot TLR =torwc Wecentk Lranslatrons Ff
eal meron 0 physical aolahec,
= TL is facter +Has Paging.
> Tt bLokes less Lirne,
Lorie: |4blres
[ere] Pla
Poo fro
[1 pete
7 EEB|—=)
SS cc 5
==
@
Share Poges ;
PILL. main advantage Of Prong
= To tA aifferent users Can share he
rey IEA
Process of sharing beet ANd NEMO tt”
Sachother:
=> Bromple- There are oli fferont Pre cesses C2)
ded olde
i he 7 ves frame cumbe
tie B pe i shaves frame cumber
Pe 2 op Cor rmamly .Pro teckion in Pre —_ @
————
~
> The Paging process shoulel be poi
SIO the tosertton Of an addrliona! br.
OTe Med ee Valid [te vile bet.
=> Yeltd Bt —Tfa Page ts Currently in memory
Heo Lt birt & called ac Valilge
=TL & Tepreested ba vi
= eee bk tha Page fs nok tothe ema
Lhen Pw brhic Called ar "Tnveses'h
STL & represented ba’ ?,
reSeq Mentakion %-
——
2 Seqrmentation ts a mmennary reanagement
techn que.
= Tb iso process in which memory fs divicled
PMEO Lhe Variable size parks (main memory)
= tach park te Called as a Seqment.
STLis allocot-} +o G Process.
=> €ach S-qment Ore stored ina tLoble
CalledaA as a Seq ment table.
= Seqmenk table comtains emanates
inforrnatteon About Seqment-
W Base.
Gd Lies t- ;
cd Base f- TL is the base Address of the
=~ sSeagment-
|
din Lente s— Tk tg the lengthof-Lhe Segment
= Tt is smotoly Used) for T—oOduler Appr-4
ain Paging technique modu les Gin be
Stored ta Ardfe reat Paes of process.2 ip, @
Tn Pagina the same method | nestle fusction
f= stored ta different Pages.
= This fs the mato ctmaback [aradvactye
of the Pogrng -
Stn order +O QvOId the drawback of fates
We Can Use "Sequyenkedlion
PF The Samentation ts O now Cocktqucu s
Dewory Qleaton.
?The Seqrnenks Gre not stored 19 CO Ligu006
meena.
2 Ee le +
tomple — Seqment table
o Nett 100 Chergers of
loo| “qo Goo-oy7 “ee
Saree)
—— ]} Cc0-100) = 100
Base 200|=4,
pAades ,
3 Rotb= 450-200. "0
Ttstes
= TL take
= fopt Gs Segment ton numberOO oro a
@ TE is the Process of
Se Gene ties the sie
—_ IPertotion Hordwaore es eos t Pr
~ seqmenteble
Logie F
See . | is
——
es
Pasthts Cpo Qevermtes logical address,
= foal Address ts Chvicted Into . =——
¥ There *% a lese Overhead.
¥* TL Ps cosiex to velomte Seqments
3 There te A internal frag mentation,
“Internal frog mMerkation
=~ —.
Aistatbute D
TE ceours When-the memory is
Into fr xed size block.
Disadvantages of Saqenedidtn _
a ———— — ==
# There ts A external fragmentation
External Pregement ton
al
BL occurs Wher eepeariory te tivide tat
Variable Size ParttHions based onthe cece of
Processes.
¥ Thee Offscull to alloate COOLr gud:
perry ;@
Difference between Tnkernal and external frog me
™,
mae oe a x a SS
“Thtemal 2, . external firgmentat
aeneiaaus te gmeveaton =5 =" S05
= —
SSS=. —_
—— 4
Fn.
™Me mo fs ctreky? buted
Tithe menor¢ rs
. n
ITEO Pixed- Size bloc — Aivtded into Vart~ble
Size bloc Heit is
then thts Internal
Pa freq metties xterra Lamy mention,
“Tf the process ts ay Tf Lhe Process re
larger -Lhan the Semoved then
wWenrory then external |
de mert-Hio ny
Taterna | take q
fm4 re a Occurs.
OCurs
= P-girg, Saqmecteb
= The besk £ib block “100
7 Compaction
fe the TL ts also called as *seqmentect Prac:
=The main memory te Avided tato
Variable Site Sequnenks Which Ore
further chided tobe freed sk< Pages
=> Prges Ore sr aiter Leo Seqmects.
Each Segment ho a pPazetble.
=> The Logica! ade ress "8 divided tote
Seqret Nuenbe 1(bose actress)
Pryce Dumber Ord Page Off cet. (3)
cd ment © umber + Ek represents SHJmenk
=— Number:
Gop Page Nesnber Ee vepreents Peye wit§in
rs the Seqrment-
(MO Page offcct, —Offsek fe withta Peyefame,
<== =—*
=J owseu4 “Fer
roby YF ood
— ‘1 Fs ff qe bs
= __ oe ee < aN
— — l "9
7 —_ oF y3OL . oT
@ -: Spb Moby or csaprr robo, fo CORO SeaThe cpu generates © logical Addvers, @
> hich ?s oliveclect into Lecoparks Laat fs
Tee Rlimber Gn Seqmenk. Off sek
fu Seqroenk $ff sel must be lese han the
=<4 ment ltanth.
> Offset ts clivicted! into Pagenumbe rand
Page Offset.
=The Pege Number & addee} tothe Pege
Leable base.
OOS 2 rtd Pet *-
HTL aeckice memory Je
¥ There is 90 pte Pregmentation.
Disoolhant—=qes. ae Se Pea? Gs se
a
# There ts teternas Pregnant HO,
# bt Corples,' [emond paging f veal espe |O
Poge faulks 10 perth ent Ses Systems|
ee een en ele
Virkrralrnensory implementes usin Demand
Toe SN eS SSS SS ——
fry -
: = Demand poge4 Is a Mewrory manage ment
tech tayjue .
; F@Ikia pro cese To vohich operating Syste
I
' ads only the required paqes rato Main
Pemory theo ihre Caltect as 'Denmanal pang’
PTL doses nok load the esti prograry toto
mate Bey at Onte.
> There fs a Swopping process.
=> The Seoapprogr bekwees mata memory ancl
Secor aq Ul
= Te f& Cte when protesc have more
memory thas the mata men ory .
ex process menor > moto menorg
=
Te 5Ge > 256.S tfthe cpo ‘s tele then the Precnss fs
loncteal fom seconcl-g remo eo
MOD HEMOY chee it 1 Calledas SWap—in,
=> Demand Peging i. TOE Teal).
pte is jmoginar¢ MESON.Cy
wo
x =
Page table When some Poqes_ore Dok fH 8
« S—_—_——+ oe =
emoy _ ee
physical men
= Ever] process i= hove aa Of Destruction
= That have instruction GT baking a
Second —"¢ peony
Dp eveq fostruckoo hove.
>The pagerbrble takes Page ruanber QIopub-
Ara frome number:
gent s the Val
Pease Cumbter-:
tAG) ord ovals)
es 1 there Ore G6, al orate) .
those. Ore pre sent tn ne
Meneny.: the phyIe Pout 2 Xf the Poge fs not present in
ine MAID MENMIY Heo tk ts Called As
"Page faust",
@ Secohg
There Ore S- steps 3 peeaimammeat| meee
step 4 Check hele Po re fecenc, t & Valrd
— Co jievahad
SERH TFL & fovalid teotht tc ~pltaerne
ativer) Lo per Ltg System,
the Pages Gre Cheotesb 19 Seconch,
‘t
TEP OTe. ~
eect: Th Pe ik Lrere her Lh 1s. GiVeato phasre)
eos es the
Page tekle |
Steet tt vegtartt ithreclion, .@
Sif there ic No Page fouls then th ps Caco! as
" Pure lemand Paging’.
Page Replace ment :
SS *t aye as
SA Poge replace met in an CPereting system
is the process
=In whicha Poge fromthe maid memory is
seplaced oh o poge fromthe Seconclary
ce Page Veplacerment errorPage Replace ment Algor-thes sc
>=
SSS =
= There Qre three types of Page Peplace ment
Algorthens
Ie fret Dn Fret Out FIFO) eye Veploce ment
AlgoriLha :
2-Cpltea) page Replacement Algorithan
a-Leask Recently Used CLR Page Replece mock
Algorithm.
| FIFO Page veplace ment Algowtthers 7
y x
== yy => &
> re Yeplaces Lhe Poyes fire ty Frrstborcler
tc
DPT fs ON Frege is Depleced with nev Paze
= thee are P efeutl; re.
If frame cize io Ahbery Prgefruth tolecren.
Efatult -
Prge sb rp ye Pade FOL present tn
| TROIS meray ther 1th Callao} a
: : Peye opeeiee:
Hit P-Ththe Pye i present in Lhe main roenoy
hen tht es bik.. [ups _#eou _ .
Ska, =e, = HP po TAT eh wel jor
Ue) mer 1
ara of. =e : =8Y, = “au foo = Ons a sy
wu Abend. amp alid — 21 210 ous +
ak a7 Pm fobey sqrasasdar 4e—___,
eK 4a ey ay ke Be tH HK KF
if=[* [| €{ afof of | 1 | Taig
Plog] | Tl Zltl/Tl)Fl ee [=] fe mah.
17 T
+t] /4 ola af4]4lAlz kk Tht] +) &/lavog
ofl ef i}<| s[ of er ]4 ele o] = i| 0 ima
Za
+ mI | Ge?
sar=f led pus poo O4 1d osn’s. hs pun
LOL OGS
longs
(1 O~ ah ‘0!
6 OM OL
ewerafs, eb dLuscroyop- m4 sa=psu0D = * ==
= rigs
* x =
© Gaby Poaceae, Bod
—S
x
Osis) FOAM CT Rsyy
x
=.=
adwoxagey
He Consider Lhe folowing Prage reference eo
1
7
EAH SELES DE LEIS, TSG 2
rb
VIED four frames, Utes FIFO Feplice ment AlgaMbe,
ancl find Page Pfautc 7®
2°Optimal Page Teplacernerst 2 (ope)
a — i
= Replote Line Page that will ok he Used for future
a eS Page fete, HiL-
Pogefuut —
Tf the Page " nok present in the wai
remory then that fs Called as Pye foul.
Es ts pre cenk 19 Le mun
Hf Tf the Poye Pe
Menor they tht is btLnDa OF = Fr am fola
I fob ae deecioe ert 4 SSD = Oy = Omma ay
ay a dan a4 TY He RY HY % PTT] eT. CTH ‘1 *
LT CTT Pets
HeCEE Ia
Ie x a ohhh eS
ele fel=[ + Flslelek $ jo le lo fol PE
a nos [if =
“sqImef ole PUF PLO Ado es -
ae Pea =A cha
FOE OTIS & O2Et hor eo 60.
es eovrefes aod Laenaiog PF AP ISCOD
= 1. x=
Ck) a roPhy qexwer0)dJex Lag pauado —! 7d 01A|emqad
@B-Leost Re cently coe Algortthm CH ACR
eS=
——
=
= Replace
the Prye tht Te oa lance Yecertly
Used.
= There
Gre page foute aed He.
Pogefaut & -TEf-the page is Not present fothe
MRaAXG seo then pe re Qa) Cs ‘page fat
Hes ry te. Page present fn Lhe mAInMemon
thee it fs Called as Wee”Lins emo,
9:0 fel > Gmafol foc = ON wmf lg [OF wy,
Jovess foro
h.o= Org <
PN pow, or
524 foo =OIPARY
Pem A, FrevaL Poy
aA
ad
d
@
Di pson2r POU
ea a ye er oe Rye EY 4 NIM “f 4 ual
“V[=) [ l= [el < j ry! {3
«| s| <¢ Jol a ° ‘o |al/e F
et ' a] 4y4| 4 |< sie aye iF
aie 7 leis
[els slo] =| 4) F<} 9] t] y| oft | moore
FP oy, PO iene = Sas
OE Saas AGP su STF ela Prof
O87 3 Se cmeri es GH OL Ot" O'S & “bog
“bse P2024 fae
Warp eateobig pes 4,
Paso cecgob iy
OCT OL
lad dump 243. 2p =L00
ae > SS * =
27 ey APOF7 -= ca] disoxawagad@
Pe vef. CPE) ee
od
2-424 162, HS, 24, 5, DUsq.
aA Use
LROA Ngo etb re) (frame No. % ¢)
a
v
> OF
Ce
a 2k
oo
ae
"ag
L en &: awa}
Cassar teal a
“+
Byyanuleodt ye f=| => ealnctys Aromaly in FIFO.l- i)
ee er —
Beledy' s Poormaly ¢ - Tf +the Prome Size is
lO cre =ceal -then p-se faut is pcreasel thie
problery fs Gite as" Belachy’s Anomoly!
ot le
SS
Pye wefereLe etstog
Liu 4,4 2151, 2,3 wT
there Qre frame are & And ftgpre are Y.
Use FIFO ep keement AlgertLben. and
Checte. Bela Ay's Aremal, .TRO=
“O= = OF F! ' “tl = OF sty
Pron fe SO = Hy "5, Palas)
A RK He ay a KK Kae
zfelel FT 4] 4 4 fawep
t/t] a S HY b= IF oly
4 K #4 wee € 4 Ke Ky Ferg
[ bh [= [ [@ t)efele] | ear
{ S | = Cp, ty rf cfef= trees fa
a [Ss & | Af4lal ey ays Veep
E eae ifs] if + s/<]t)) Doeae
Mer oe Mir =O 9x
hiv =O25 bra Olé
oo 7
Tf frame Sumber ts three then Prge fault
fs =F
as frome nueober TS four then Pegefault
fs=—lo.
| frames Qre.
Sa If te frome Humber
Increaced then Pagefartt
Boelacky's Anow!4.
ys Pocresced
ten there ts
Beet Algortthe for Pye tp cement +
joie te
a SS
atk Sequence,
Opr < Lew ~ FIFO
Les Pasefaatlh pres
”, Opt > Optom! Poye Teplhcement Algartltyn,
is beet Algorithme.
=Vhich qives less Prjefoutts.
=> RRs beast Recently Used Alga?
nek bel Algoarthm .
Lhe ic theFirst fit, Beek-fit, Worst fit ©
SS Se Se Ss,
9 Thee bechotques Are Used 10
OY
cb Mu Wtprogcaererning ith Er of Tasks
nw CMT)
@ Muatltpro Toning WIth Variable Partition’
No-of Tasks, CmMvi)
a
Allocate First hole Lhat fs Bre eoough.
( Able rs the enrphy block),
ee Conaiclee G-Parttliore of 200ke, yooks
Go00kR, 50OKR, B00kR, Isokg.
The four Processes Of Q57KR 210K, Y6Bte
4aqgke
PR 2noke
> 460 ke
Ro 44ke
bork fs Nok allocateIte f= Lhe Peocess of
Bet fen’ Alloarte smallest hole that i's Bey eragh,
oT tthe bet Algorithm,
aoe = Consider 6- parktlione of 2c0ke, uke
Gooke, 00 KR, Sapke, Sob,
cyanate B = B5tK6
| GOOK Beton va lest) R= noke
{Sookie P.> U6B ER
SOOKR, Cmatlert
|_Pa = Py —> 4a ke
2O0KRy
| Is Kav Corolle)
Loree Lb 2 thie fe Lhe reverse Of bat-frbrere
aoe
eRe cect hole Hut rs keg enough, ;
opemeg Syoten.
arople
wort Pia S54ke
Z 200K
P= 210okr
teokalloryes) "
ae 46s wa peso
500! ah G4) KB Allo terte
3a0kR
250 Ka| ©
Throshtng ;
=r ==q Ifa Proce Sperte more Hehe
as Pratog Yether Lhon erections
ie Called as "Thrash. nq:
= Thea fz a stappr
oT bebveen memory meno
ard mars eNO. . :
2 There cave. Page faethe po,
Nezatt
Suospeng. a : eat
7
There Qre ti909 echereyue. ‘ chegren cof erutlt— :
7 _ T= Os
ot TN osete rmocle!. q : Progr Tee!
These ore the teechnraypie: to prreve talc:
Thrneke t 'Vee lore seb mrrctel ~ @)
===
=> + =
Tt works bred of Pricetple of toerey Teference/
Peoctple of Loceltby .
Local.
ros ¥efecence +
ae Lefer
T+ exentes some Toshruictmo: roof aoe
Wepetacty,
PTL teks Lees Lime beget Period af time.
=> oT set moclel x Vepre sectbect bh Getta)
> EL
Tepregents active Prges.Crorten PogeJ,
PALA value & Se Lhe crore PageePasgt wil a5
1 4 value ts hevgey then Stores lJ —— fe 7
955
ses Prae facut frequen —
Se Sy SS
= If the Page
-feutlks rate
aeons the
> Threshing :
Pe er beune
| foal 7 sia ore
| Me noe bownd—> rf Pojefeuths
| f ne ae the lac
tent en the mene
TOf frames > X Ore Demoved pe °
the Procece