Untir—O) : ae pees | Gremexal Method :- Dynonte Peogea muri is a method whem a given | preblen te divided ftp Subpeeblems . The Cubpeeblems | owe then belved & Stared th a table. whenever the (Bhuation of colving dhe Same fubproblem oettes, [then Uke cboted dalution ie fetched from the table Wittead OF secomputing the Subproblem ayoin. The ideo pil dynemic parysom ming r 1* weld solving tee tame pavblem twice” |- Dynamite paegsnmming ft bated on 4te puinerple of Topttwality’ of ts typteally applied to opttutzatton problems, On uch problems hare Can he many solutions each Aoltition hata vale k we wite ty plrd fa solution oft the optinal value Majet component th Dynanddc Pept ainanang 2? dy Recursion = Golve Ur peeblems recursively vw Menrelzation + qe clece the pee Computatton oe Auteparblems +) we gutter - (DP) Dynouste programing 2 seturtion + Menrott ation, ete.” ie Complensty Uthng DP fy o(n) On dynoute parqsamutng an optinal tosuente of decittou ace obtained by walling explictt appeal to the “patnctple optimality - | |Patuctple of Optina Uty a On thir, the decisions sefulting from the plac decttions har a property, that “Hey are ih opti fegunce teretpective of lee infttal “state vw dectaten oe alwo ive He epttmal solution 460m manny peatible eaksBiogt Ohta! elution wilt be achieved pom The intel state t4telp - when ee ty not pottible +o apply. the principle oF opttmatety Pe te almost tapestible to obtaln th Solution Udine dywonic pemtenlng appsoach - aoa Fading the Alotist path th a qfven qeeph: [The dipgercnce be ttoces the qeeedy & ywanate parqen: mamaing te that b gece method ouly one decision Sonvene ever wo 7 On dyrante preqermning any mot be generated - Choractectitics oF dy woudte pargeamning te 1 Stuple Subpeoblems eS we theuld be able to beeak He euiginal pasblem tte Same Struct. dectttom Aeguences faty swaalt LubpsoGlems that have |>, Optimal STeucGne of Problem = “the optinal telrition ty the problem Contains vofthtn opine! elution to ttt 4ubpssblem. 3, oveclapping subprotlams :- These ewistt come places ushore we Solve the tome Lubpreblem wouttian once:y —— Steps fer solveny peotlem i DP. |" Beackt dewy the complex problem tute Sturpler | Aubpreblems- - iad the optimal telution 4p thee —Subprobleny. Chote tte ectult of cubprebleny ( Meweettattion ) ~Reukes 44, abeve setults Xo kat the sane tub preblem ie calcutated werrltan onrte- - Phnodley calculafi Hee eetult of the Complen problem. Approaches of Aynourte Paewgcnmrnng b ey Top- down appsoach = (Menret?2 atten) (on tuts appasach the puoblem i bselten fate Sb jpreblems % the setult at each Aubpascblem 1s semembere when a setult at tubpsetlem fc need ein further, fe te gest checked By memoty x then uted: 2 Bottomup Approach > (4uble Method ) stuis approach pellows the tea of Computing pirat & wreves Sackuomd- ot ts done to aveid the Ptmem secuttion. “the wolle inputs at each 4tep fn the bettouup approacheontiibule ty fem Aacgqer ote: Applications 2 optiacal bruoeg Aheorth tree 2, All pais Ahertert path preblem 3 Trove (lt Aoles peecten peeblem 4, Of) Kuapsack problem F, Peliabilily detign br thntn motrin mullpltcation t Sela algscttims © Opttutied quaph alapeit temaOpttnnol Blane Search Tree On BST the nodes ‘yr the feat Aubtiee have Deere “Value than the soot wode x the odes fh the Cfghe Aubteee have queotr Value than Hee toot node ; | the cost oF Searching a key tc very (nportant in Vosfous application - (Given a gined cet of Uextiyiet, we wteh fy caste a bi Search Ree Aqanization. we mow expect dipgerent bf Seorth trees fet tle fame tdewtipar Re ty have dippereut pergotmance characterictiy. Saute "The: possible bh. Search theed fot the Pdowtipfer | det (01, A, o3)= C do, fp, while). - Wh a) (dow fohtle) Ge. _ CH x é 7 > BH ay Ge) ety) ce Gouele nll CB) | (ao ) ~ 7 = colle do) ) Go) ee ww Ae ay © thee A seqtiines 3 Compartions tree B teguiter 2 compactiony tree C teguies 3 Comparitont tree BD teguires 3 comparitons tree E sequicer 3 compartions, Tree B requires leatt no of Comparisons ¥ teee having optimum cost fe Enowmn af optinal brracy Afeatch bree.3 Let ut atvume that the given tet of iclentipters [ts Lay, a... an} with aca, e--. ay Aet PUI) be Me (peebabrltt, witth which we feaeth for a. fet ¥(f) be the pesbabil tt thot Me foleutipiee % ety Searched fe & Such that ay 4% ay), Of7EN Then Ss 4Ct) is the pe obo btltly of an Unsuccer- Os a wl, 3)2 wl 2,2) +P(3) 4403) = 4 L443 cC2,3)= wi es ) sores {eG 4 6G,3) to 92, 3) = main fo40}43 Rea 23 4G, 352 % Tey = 2003, 4) 2 wld, + PCH 440E) = 1414123 €03, 4g) > win fees sy eCard P+ G4) = 3 sieSt ~C3,4)= 4Contider ta Set whee jf=2 Tor, Tis, Tay Te Loloay= wle, +P) +4@) -et3rlen cl0,2) =nin “eto, 0) + ¢ Cua) +e (0,2) beng Pe Cot te Gay Celect Wtn nuubep ata) = wate fefrec xo,2)+) 3 01,3) = wl Dt PGF Usye Tl +l 9 cln3) = mtn {coapees aia 2 res ett) +0G,3) eea,5 = win {5 prac) | &- City Se 2 Tay eat, ave wo 2,3) + PCED FE VL4) = B4lt le & cOo,4) = Min nate } uo ta, rea e(z,3) tela r4) bs 2 Pek mt Tate 2(2 4) =3 contider the tet whey q-t=3 To3 Wo (0, 3) =o L% 2) + pls) +v0s) slotiaiely | clo, 3) = win cto,o)+e(13) | oc kes cto +ca,3) p tex FeL2,3 eto) +¢(3,3)wl y)= wlt3)+Pl4d +9 (4) = 94tltle cULY) = wily fee Nt cG,4) leke4 SeturdecGiud 7 t01,4) Feas4 (ece3ytclure) ; e emin dig batts 19 12 2tuy)=2 Coutider the fet estes j-f-4 oy — wo L0,t¢) = 0 Lo, 3) + PLYDFE ULE) = etl tle Me 00,4) = nin ClO,0o) #cCn4) otk ey clo,1) + Cry) + w (0,4) Ket2,3,4 | Clo,2) +cC3,4) Clo, 3)-+ CC4,4) 19 = 16 +16+32 23 27 Llo,4)= 2 The table containing Ha values of elif), CCAR Fiom the table, ft can be Seen that clo,y) =32 fe the [riiaturim cost of the bf Aeaech tree gor (4,,4,,03,% “the tree hos sort uode «+ (0,4) = 2 The procedure et Cosco % eptinnd btua Keach teee ig, 'uye't ~G, L0,4) tigut a iv ee , +e) 4 1 /4 i $s a a 3 AB 2 RLS 3 w ON’ a\-; 3 as \L @/ 3 sé x FIN 3 X (0,0) uf, votation Lewy? atl the 3,3)+0 until feat ucelet becemes Zero. Enpanol thie the eptinca! btnory Seacch tyee 0 s(hINY T0208 ae@'DT Ay oy 42 =(h'aq?) 4€=(4'0)7) N= (m0) do bleCh Qa st=( '0)9, tech jen bie( 4!) a uy fo, BCH’) 2G ye i= OTe 2472 ge (ion) E=(8/e)em Ls(e mgs 0} By hy, tau, = 7 4 ) 2) 0=Co'e) 7 ' AY 9=@'D)2 9 (0 =(0" : > 0 =(0'0)9 (sQat® yon] (= CEMem 42 (eM! £2 (OM -t=(a!0}0n. I thy ee, =u, nal 20,7 or \cnopSack stag Dynanric Peogedmnuiing fe on qteedy Method of Ute e@ject & placed th te bag ot buapsack, ft ( treated Of | olteeuste 0 cind lhe pactiol ebfect te alto placed th ltr bag. But | in dy namic pany ak mntng paetio) object plact fs not possible . Here contider owe ebject & selated voeig lity & paoptte = cee wine ine dled” coe a, ~ Cl aepectent ro por cible Atakep stesulting dom The of declkion tenentes 400 W,4,..- Xp- ~Each mauber 6! te a pair (Pw) whure p seplerent peepit wo sepectnt total wetght e object facluded th tuapcack - | 7 Suittall) f= Loo} we compute ot" pom é FT obtain fl note thot the poscigilttta got Ary) are Hey tO Atyyel> . when 4,20 the sedulting States ou anu os for co). 1 weoken mig, 2) the serulting stata ase obtained by adding | ft | Crys Mpa) te each ens: mcall The cet of there additional Cater of sho } Klos aa can be Computed by merging the Skater in s' and together. FS SS! contacet too palut Coy, 3) & CP We) with the prop eet that Pp SPE and wi > Wr lten te pau (Pwo) con be dAtscacded- tus te called ‘purging’ aul alto Kuew as dewinane sulk. (dove ploce He objec pilith te havtina me Re wedght & few propit)[Here dewtaated tuple can be purged te CP pup) demiuatis (Py,w;) 4 The wWettt cate Huw Complentty i 0(2"). The bett cate tHwe Complentty ic OCN*w) N- KO op (tems, w- capactly of Rraptack, Ent Consider Me luapsack fustance N=, mMr2UI, > 42,5,6,1) w= Co, Is, 6,4) a” Pw ~ Oattially t=0 and £= (0,0) se dg s'| to qet neat cet Now calculate S). Fer this tate 1 object propteu wetg pati. f (0,0) ° vy wi fo) sh =f W42), Lot) P= f2, lo} sol, gusts {(0,0), Cr,10)} ht. Add to s° Apter ginding each fet "or clo cov 5? apply Purging aule wk discard tome pairs by wdting pornuda te, (ew, CP, th) +00 pales | % (hee) x (w, 2 w,) then discard hut pair else beep all tu pau as it fs. calculate 1 s% 3 gf bas s'us,' 6S &,"= florso+is), 245, w4is) t= {lS is), C4 25)} | &> (0,0) (2,10), (s,15), +, 259}tue aentove ta pate, CH, ae), walk because, the wekght of the object it quenticttion the Knaptack weight Ss { (0,0), (2,10) (o15)} bg: (G8 > flore o+e), C48, 040), (E+E, 1546) } . = {04,6),C10, 6), (13,2} Boe S=S°us*s (0,0) (2,10) (S16) Ce, 6) (10,6) Cas 1) . (gis? “ Hur sturove th paiu (2,10) because op pusgtag sul- The coatght of tte object be qtsaticthan th (e,6) 22¢, 10>6 4 S<8, Is >6 s® (0,0), (8,6), Cro,16),C13, 21) F (D3 {Cots, OF9) (+1, 649) (tort eta) Cat! DAD} ={01,4) (4,15) (iu 2s) Ct4.30) F . gi. § (0,0) (8,6) (19,16) (13, 219 Cla) 15) L025) 04.39) - Hee aeureve (1,25) (14,30) . Motthan the buaplacle weight - oe Fo, 0) Le, 6) 12, 16) (13,21) Ca) (4,159} Gelect the pale ushtch have eoefght m= (13,21) es? ves alto check (13,21) € s? Yes | coustder c? only . On Solution vector select 34 object aud 2efect uc" object Subttact (13,21) rom (8,6) ait beet (13-¢, 21-6) = Gis) € s* (eto) fs present in S* Again check tows’ 4, >I Substumet Leis) pom 2” object (oDee a Co, o) gc! Wao a és Yes w WTO Ffusl volition vector fe Cog, %g,%4) 2C0, 11,0) prepit = S+Q-18 eur 3- Ma nag, pests Liais of voefght= 12,3455 | eo) Stl. ely gi : Outtiolly g> lo,o} SP= {O0+1), Cor} SPs St24 Ss Sy ct = {10,02 2} Aprly purging oule 041, 042 . Noc ¢ c,'= { Worr, 043) Ctr) (2,43) } = {G@,», GS)5 2 = { 00,0) (1.29 (43), G5} | nto chomge | cre tlots, 044), UES, ata) (245,344) (345, s44)} She Lts,4)C6, 6) 2 (8, 3 ~ wo: | 67> fs, 4) (6,6) (aa) } emeeededS= { (0,0) Cra) (2,3) Gs)5 98) (a)t a Applig pacing sule % ceweve (3,5) 62 § (es) G1) Ces) Cate) (ya) C19) (13,129} © Les) Ca.) C88) } sts £(0,0) (2) (3,3) (sa) (ey 6,1) (6, DIMES ste $ (0,0) Curva) Cs, ww DOL, DE, O} Solution vec fe (4% xy) mot Ader pair ceneider L€,¢) as ft fs Gey ect “a yet (es) € 33 4% obsect (6/5) (g-6, $- s= G, >) (13) € 3? G3) es Oy ¢ 8! [A= 24 object (,%) (2a, 3-3) = (0,0) (o,) € 5s? (o,2 € s (o,0) ¢ Ce 1,0,1)Algocttam:- Algoettim DEP p, vw, n, m) bee fto.0}, ! a tt +o n-1 do = £0R.w 9 Ce Pr, W- We) esta wemt, “ = Merge Purge (et I ghty, Cex,wxd= tact pate fp gl. Cry, wy) = Oey PW! twp) where Ww! fg the Lora est Win " Sretthat Wp wn 2 m; Ae pde in Ss WTaace back KO Hin y TEC PX > PY) then a,=0; else ayet; Taace Back got( tn4-—-%4); jAU pots Slontert Raittes + fet GQ: {ve} be a directed qeeeh with n veelicer. Let Cott be @ cost adjacency motrin 40 G Suchthat Cott (%,f)=0, leten. Then Cf, g) te me Be wgth oe edge Chg) # Cr pve Eca) cond cost (fj) =a H tej and C5) d € CQ). The alt pait cheetert path problem fs to determine la matutc A fuch that ALE 7) t tre fewath og Shortest jpath gtom ftv j- The moteli A Can be obtained by colvi ‘ Single Cource problems ting the algorithm Gugle Doce clrortest potk in qeeety opprsach - Stuce cach application of this procedure ~agiines On?) Hae, the Motrin A Can be ebtotned wm Oln3) | Ata [= ebtacn an attenuate oln) Colution +o +W2r peodl, em uttng the painedple of optimality . (Refaciple of Optacaliy © Oe Kis Hee node on te Shectert path gem Ttof Jinen Hae path grom to K and K to j anette alg es cuecteat Wokile Centidlerting XK verter af (atiewadiole verter, there oxo two “pesibtlities: |-Op ets wot past of Checked path prom Tt j we coep Atttance DIES] af it Us. oe fs port Chertect path from Cty jf update distance BEGG)? af OLE KT+OLK Ss]is B= 2a \-2 +8 IH 4-2 > 6 (-4- 26 ¢ Kk G t te of . a le given ag Rettsanl (Boulton ay Se ee . _ | | AKCt p= nin fat ‘CL$, aT et aX (KSE e21 en%- G — = ats (i) | % el. Construct cect moatety ~ i a’. || oo 2}6 oO 2 3,3 co O ts Ko path ftom veeten Ve 1D VY, “Thurepots ‘co’ fs placed . Fee above cost wrortey We have te gt Matrices 4! a® a3 » at iat Cro. of Sf veetices are 3 hence Al A® as ATCA, j Jenin fa he) +E" De ja} aX no of tterations @ h “the WOO Peeeattons depends Ory the nd Of vertices in the grafWD AU on a! ncrtatn Went se te fF calumn ot Pt lef Av aud diagnel vals alto 4ame- o4u A. ]6 © - 3. 0 Woe need to gfnd A (2,3) and at G3, Vellues Utng 4ernuta- tule A'[a, 8) = mtn {a"'o, 3), ales, ta (.3)} ee = wn {8 Gada Grew dF smin {2, 6+ = win {2,145 Here aimtuim valu fe ‘a. fo, Select ‘2’. mtn La (ad, V3) +A (024 nin foo, 344 f= mt £34 oyu “ [ee ie 3 70 From Al matete we get 0” matuin on a! teep aNd 20, 24 colomn of ft (6% tnd stemaining valu 2 ot WA = 6 0 2 70 A713) 5 a (3,1)a™( 3) = mfo 4 a us), aT + AG,3)} = wily fu, Gtr f= nur, fu, ey = nin {63 (aD = wth fala, alga salad} =win { 3,446}> neta {34 ra o 4 6 37:0 Now, Grd A> wmatrin prom a> matele. on A” beep 24 sow att colomn as ft is pied ennai DL | o tf 3 7 2 AM 22 won 4 W 2». ae! Cuayea™ (23 amin La 2, ar(3) + & (3,25 ewin fy, bet} = 4 A> (>,1) = win Sarre 1), a>@3d407G, Dt awin £6,243 5=f5h. Final Mote Lt, woo 3 7 6 Frem +h we verte aie path prem ane veetex to ony ether vuter we get Shertext path:| Ie Algorithm At geet atlpatty Ceost, Ain) MW cest Lien ,tt nj te te cect adjaceucy matrix Of % qeaph ott m veetices ALE F] Le He Cock of 2 Shetkeat path teem veeteu ¢ to verter J. cot [ft] 00 ter leten #er f-1 tn do bet §-l tn do ALG] = cost Lift, Mcepy Cost tanto A fet K=lton do te fat ton do ter f= +o n do ALES ]= mtn CALLS, ALL ET + ALK ID)5| Teovelling $ Sater Peeton Problem» On travelling Salesman problem the Calleaman has [to visit eveer one of the ties ty fiom a cectac, | eke ond to selten the fame ott - eohth minum cest - We coetl qe 4+he nilnimum Cott et distance Ut fOimula. t C6, 8) = min c e 7 wo Ley tg Uh s-Liay Pica starting veetin (a Set of oll 40 i veettces a Selecked +20 Let ‘t Cie. by one on teravell Colerman pucblem start at vertex A avd yictt all otmee vertices and come back to Same vetixn A, On the ~ a concider ({) sb the Seucce veetter: aud sensed ag veetice, aw 2,3-4- gar °o 1 ts 20 gs Oo q to 6 3 o tr g & 4 °« ms i tenth neo ele mont 13 Ontttally Is] = at. és S10 [sl-0° Wa Cares te 140 & q(3. o)= 6 q C4, b)=8 Isl=1 Tsd> om fey tad. {s3-J f Lie £3) > win [os ti {3}-3 } G03 J = eta {9+9G,6)}= aneln (946 h2 15 te T4D= mim fou eg ce tHb- 44 onein f wre le, od} = mtn (loteh =! 1 frye min fe,,49G, t23-2} ewin {e,, +9 Got min {B45 F218 | qe CHB) =z mrin Fea a, Lage 4 Famin Letey= 2° Bere t2D omin fe ag tog -2t = mn fateh 13 a, t3})= min f cag tq, t3}-3)}- min [4-46 }=!5} Iel= 2 te (3,43) = mint d Ost 4G, 13,43-3 ga Sut oO Bue + } = wi at 7G t4p pin 3 12 . ° treet ite-tsa ~ [iets fmm bs Lycs.ta.e3) zwin pense pope als forgery} t Suet gt, te4b—4 a+ qe (25 | nin $310 Fin fas}[Is] = 3 TOY La, 43) amin [se 12,3,4}-3 gq 2,34) =nin Sl baa pea “este (3, {2,3}-3 cin fang ehh vein {ONT bom fash 4a aC3, 1239 Atl cy tq 203, 4p > “uta le, (2,3, 43-4 amin pt gl, fay} . (tote 'StdG tayy 2 = Mn pice = Mins) ret 4g (ur {2,3} 20 423, cost (LO F1O+ A+6= 30 The Complen tty ic O(n).Re linottety Design t- Me ie Wed to det a System that bs Composed Seyerof devices connected in Letter ; fet 2¢ be te reliabiltl; of Device Dy (Ahat ft a7 is tthe probability that devia Lt will function properly) then the seliabeltig of the evbhe Sytem fe Tar Even te the TmdPuiduap devices ace Ae velia ble , the teUabiltiz of the fystem may not be wey good. Hence. (EC desenGle ty duplicate devfees Multiple Copter o the fate deulee type ate connected tn pacalle! Hheough the | Use og Sebring Ceeufh. TV JAmp are gunctoutng peopeely “they dhe M ere fuch device at each singe hey n walle Ute {> > Pa | -_ Lap g et Stage 2 ae Stage n Ds | Dy | Or | | >| Pr Ds L+----) py > Dy Oo os Dy Dy Sp Gage ft contacns my coples of device Dy, then tke proba- ae wp “bflily ttet all my have a malpuuction ie CI-4,)) ae Heace Ute selrability op wap Maet be fy the eamge toam-2u,. An epttna) Seluttin rym, te tre tetult of senuonce oy decisions , ore deciaton fee each my-Is | Destn a Hare Stage Sytem wth device ayes ig D.dg,Dy The cet, ore 4230, fIS vw $20 sepecttuely the 11 Or, | t of the System i to be no meethan $105. the seliabrlel cet : op each devs Mype ts 0-9, O16 KOS terpectivelly. fel we ottume thot th Cage t ame devices of Fore 4 % pacallel, then elm) = t- U- ay) | The Cort of 3 devices ote i> 30, ¢, =I ¢, 220 ella Flite, SS 3 devices ar 34> 09, 2 =0.g tga 0 Upper bound at each Sage 7 J uy [ery -¢ c;) le; | eppebeund t& detce| fe = fat = us (ost Bo -& aC potter rze)) J | = (35-65) / 36 = Fo, mo aesptel op device 4 Uppebeund ft device 2 fe Y= (lor Fis (204 S20) Vie = (20-65) Js f2 3 Copier og device 2 a2’ 3: Uppecbound fe deute 3 ua = Gos420-Crotis4ss) fy 6 = 8 Bceptes | device 3 “c fez = (OS-65 J/ao= bof, .| Om dyna pargeannitng, 2! Conatets of tuples (ice (a,c) 2- atinwilely, c— Cost elo) = max cue Cor) ey Con comp) f aa. Ss Lue} (we can ebtacn each Si gem ch! by taytng out alll jpostchle values for my and Combining the ssulting ele togetter t Ss; => f sepssuate Stage ho = | 4 aopectente no ef Copter of device. Usage Si +o sepaete nt all tuple pittstoils 4uem st by Cheeting wrt Compute sus! — Device | has 2 copter hence gfad sis! pa ' S = fat, Jou mypefe! : beim) = olm,) = t- (ea) et (1-0-4)! = 0-9 Cemp = Crm, = SOKI= 30 = {o-a, 30} st > f-Uf=2,m,22 bets) = O(m,) = t- (0-9) 2 0-99 Cym,> 3O42= bo Sy = {o-99, 60} S's sos! = {o-9,30) (0-99, 60) }Device 2 has 3 Copies, hence 4nd ge 2 SP, S* s3 sos Si f=2, fat, m db: (mr) = Gm, = yet I (lay (eo s)/a lo asog isxl= ism 67: (eg, ts) Multiply +hete values with s' values fo get tired cet 67. S = flo-8x0.9, Botts), (0-499 x08, botis) } “{@ 42.45), (0-742, 1s)} S$) > fea, Isa mer am Olu) = I= (= tgy_ (i-d- 0-89) = 0-96 CaM, 2 IS Kr= 30- 5,72 fo. 96, 30} ge { Co-9x0:96, 3ot3o), (0-994 0.96, 60430) f | a = {lo gou,60), (0-95, 90) Ss, > f=2, J=3, mg=3 . = elm) = t= Ua) (1-0-8) Cm = (S35 4S = OAT. See flo9 x09, 3044s") (0.49 x0-492, so+as) } = {0-€92¢, 45), (oagzog, tos) J SS Sho st vos”e § @a2 14S), (0-192,45) (0-864, 60), (o- ae 40) (0-6428,25), o-78208, wos) F By c i Oe we cost, cRinifnate Some 4 becleing dews. zule paler. | * (0:-742,45) (0.8928, 46) part have tone Cost simeye the pale wth Dero selina bibety (o:192,7¢) & seurceved. » Apte semceutng tho pals have the conte au f Ite Aol oe % 4S, be, 40,15, os The cote thould be in oles oder but gor 45 a Remove the pal (0. 504, 40) = U(o12, 45), (0 864,60) (0. gars, 15) (0-9 208, vos) f capt Se Pag tL hat 3 Coples, pind Ss? ges my = fe =! | 3 BP = =3, j=, baimg)= os , Cam,e 2OKI=20 > (ors, 20) Ss [lore x 01S EStr0), (0-864 x0, CO+20) (0-842 x 01S, TS+30), (0° F8r08 x OS, (OSH20) F = f Co. 36,65) , Lo-4 3a, 20) Codebu, 15) } senreve CO9gr0¢ x O'S, los¥r0) pate ,becaute cost exceeds [05. > by (my) => f= 3, J=2, mye = i -os)*: 04 Cam, = 20x 2-40 J (0-75, 40)6,7 {(er2%0-78, USt+to), (0-864XO7S, 6o+40), Corr exo.7s, 15+ 40), (o-9g208x075 (oS+4o) } Here 2 pars aeursved cost > 105 = Clos, 85), (0-648, 100)} S35 (= 3,j=3, m3=3 Shs ds(mp es or 6ae Cammy = 20% 3=60d (a, c= (0815 bo) Ss {Coa 5 087, 4S 460) (0. 86¢x 0-875, 60460), Co-€9q2¢x0. E15 , 60410-98208 x0-R7S, jos +b0)} weueve 3 pals cast > lor ae Co-tax oe 75, oS) = (0-63, los) s?= su s,3 > {0-26 65), (eo 432,€0), (or. yy bs, 15), (0-54.05), Co.64¢, too), (0-63, tos) f 9 Corgyes, a5) x (054, 85) 5 the seliobelety & tows cot te bitgh by (one 64,45). Hence serreve the pate . (063,105) fe cewpared colt Co 646,100) | (0:63 jtos) pote fe Low seliable . then seucove the pale 0 = Apter semrouting stz $(0.36, 65) (0-432, ¢0) (o-S4 85) (0. 646,108) } Faem > we Select Lost pate uolich has bert aclinbtlre uth cest 100 2 log ¢ (0.6ue inn\ 20% A mae| Hence au device. seauired 2 Ceples. =) 20Ka= 40 tog \t00- 4O= 62 Sn Stage 2, observe Stage 2 whee 60 code” f= & 1 Slo bb, 63) E52 > mao Device 2 alto Nlow cost ft Go- Stage! coct(20)= 20 COTS present aonguiized 2. Copies. => 60-30= 30 Check whee cost 39 ik pretent ih stege t s'= (04,20) € ¢)' Heute devfe | 2exutreed ovly tespy. [>| Dr Dr Da D3