Introduction to OptimizationHomework $4$Question $1($simplexalgorithm$)$Letusconiderthefollowing$($LP$)$:$($LP$)$maximize$3$y$12$y$2$y$3$s$.$t$$y$1$y$2+$y$3<=22$y$1$y$2$y$3<=6$y$1$y$2$y$3<=4$y$3>=0.$Find the optimalvalue of this problem$($i$)$bybringing$($LP$)$tostandardformandapplyingthesimplexalgorithm using Tableumethod$($ii$)$Computer task: Solve by applying Simplex algorithm of any package of R or Pyhton or Matlab

Question $2$COMPUTER TASKThe travelling salesman problem asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?Apply Genetic Algorithm to Travelling Salesman Problem $($TSP$)$ for the following Table. The table below shows the distances between each city in kilometres.A fitness function calculates the total distance between each city in the chromosome$$s permutation.