Consider the following 0-1 Knapsack problem. 3 + 5 + 2 + 2 + 4 + 3 + 1.5 7 , , , {0,1} a) Suppose our initial is solution (1,0,1,0) and we obtain a neighbor of a solution by removing an existing item and adding an item that is not in the knapsack. Conduct local search by accepting the first better solution and accepting the best solution in the neighborhood. b) Suppose you were solving this problem by Genetic Algorithm. Provide examples of crossover and mutation operations. c) Suppose you are applying Simulated Annealing and you decided to accept infeasible solutions as your current solution. Give an example of how to incorporate this into the evaluation function (objective function)