$1.($lecture $6)($problem $10\mathrm{.}6-5,10$th and $11$th edition$)$ Please use solver software Gurobi or Scipy to solve the problem$\mathrm{.}2.($lecture $6,7)($problem $10\mathrm{.}3-6,10$th and $1*$ edition$)$ Please use solver software Gurobi or Scipy to solve the problem and compares the solutions with those in the individual question $(2$b$).($lecture $7)$ Consider the TSP example in Lecture $7.($a$)$ Please use the brute force method to find out the distances of all possible routes.$($b$)$ Which route has the smallest distance?$4.($lecture $7)($problem $11\mathrm{.}3-4,11\text{'}"$ edition$)($problem $11\mathrm{.}3-5,10*$ edition$)$ A country chairwoman$5.($lecture $7)$ For the Knapsack Problem, please consider the Memory Functions.$($a$)$ Please finish computing all of the remaining expressions.$($b$)$ Please verify the correctness of the values of the table on the lecture