Convert pseudo code to matlap

Convert pseudo code to matlap and this is the code : lgorithm 3 Iterative Target-Oriented Algorithm (ITOA) Input: S= set of cameras; T = set of targets; P = set of discrete pans; K= No. of set covers Output: C =Collection of Set Covers C1 , C2 ....CK 1: 2: 3: 4: 5: 6: 7: 8: 9: 10: 11: 12: 13: 14: 15: 16: 17: 18: 19: 20: 21: 22: 23: 24: 25: SENSORS= S /*SENSORS keeps track of the list of unused sensors */ k=0 while SENSORS ̸= ∅ do /* a new set cover Ck will be formed */ k=k+1 Ck =φ TARGETS= T /*TARGETS contains the targets that still have to be covered by the current set cover Ck */ while TARGETS ̸= ∅ do /* more targets have to be covered */ Calculate Fuv for each su ∈ SENSORS, pv ∈ P ; Let a sensor-pan pair (si,pj) covers Φij targets with force F′ij such that: Fi′j =argmaxvFuv;∀su ∈S;∀pv ∈P; ∀si ∈S;∀pj ∈P; Ck = Ck ∪{(si,pj)} SENSORS = SENSORS \ {si} TARGETS = TARGETS \ {Φij } end if end while C=C∪Ck end while marker: return the collection of set covers C 1: 2: 3: 4: 5: 6: 7: 8: 9: 10: 11: 12: 13: 14: 15: 16: 17: 18: 19: 20: 21: 22: 23: 24: 25: 26: 27: 28: 29: 30: 31: 32: 33: 34: 35: SENSORS= S /*SENSORS keeps track of the list of unused sensors */ k=0 while SENSORS ̸= ∅ do /* a new set cover Ck will be formed */ k= k + 1 Ck =∅ TARGETS= T /*TARGETS contains the uncovered targets */ while TARGETS ̸= ∅ do /* more targets have to be covered */ Find Dmin = minD(t) : t ∈ T if |Dmin| = 0 then /*TARGETS contains some uncoverable targets*/ goto marker else S′ = ∅ Find the targets having cardinality equals Dmin and create a set T′ for each t ∈ T ′ for each (si,pj) ∈ Φ−1(t) S′ =S′ ∪{(si,pj)} Find the most contributing (su,pv) such that: (su,pv)←argmaxsu∈S’,1≤v≤qΦuv∩TARGETS /* selects (su,pv) covering maximum targets */ In case of tie, create a subset S′′ ⊆ S′ with all sensor-pan pairs having same contribution Let (si,pj) ∈ S′′ has the maximum force Fi′j among all sensor-pan pairs in S′′, i.e.: Fi′j =argmaxvFuv;∀su ∈S;∀pv ∈P; ∀si ∈S;∀pj ∈P; Ck = Ck ∪{(si,pj)} SENSORS = SENSORS \ {si} TARGETS = TARGETS \ {Φij } end if end while C = C ∪ Ck end while marker: return the collection of set covers C i f