i need the answer types in IP form, not solved in Excel.

Preblem No, 1, (5 pelnts) A man who lives in City 1 must deliver four packages to City 2, City 3, City 4, and City 5 and them trearm to City 1. The divanees between the 5 cities are given in the following Figure. Notr that eely feuille routes are ahown in this Figure (twote that the distance trom Ciry i to City j equals the ditasce froen Ciry) to Ciry i (d2=d2)]. For the LP associated with this TSP problem (ubere the ofyective is to minimity the tool dismoe trwelled by himl. which of the following is not a subeour rlimination constraint? Assume that x=1, if eity j is reached from city i xy=0, etherwise a) x12+x21+x322 b) xu+xet+xyi+xyy3 c) x14+x05+xy2 d) x3+x12+x32 Write all non-subtour elimination coenstraints for thas problem in algebraic form. Preblem No, 1, (5 pelnts) A man who lives in City 1 must deliver four packages to City 2, City 3, City 4, and City 5 and them trearm to City 1. The divanees between the 5 cities are given in the following Figure. Notr that eely feuille routes are ahown in this Figure (twote that the distance trom Ciry i to City j equals the ditasce froen Ciry) to Ciry i (d2=d2)]. For the LP associated with this TSP problem (ubere the ofyective is to minimity the tool dismoe trwelled by himl. which of the following is not a subeour rlimination constraint? Assume that x=1, if eity j is reached from city i xy=0, etherwise a) x12+x21+x322 b) xu+xet+xyi+xyy3 c) x14+x05+xy2 d) x3+x12+x32 Write all non-subtour elimination coenstraints for thas problem in algebraic form