#3. [10] Heuristics Consider the function F(x) given in the following figure and define the optimization problem as Minimize F(x), x 8{1, 2, 3, 4, 5, 6, 7, 8). 7 6 5 4 Il. 3 2 1 1 a) [4] Suppose you solve the problem using Greedy Heuristics with x = 2 as a starting solution and the neighborhood N(xx) = { Xk-1, xx +1}. What is the optimal solution? Show the procedure roughly 3 done. b) [4] Suppose you solve the problem using Greedy Heuristics with x -2 as a starting solution and the neighborhood N(Xx) = {xk-2, XK -1, xk +1, Xx+2). What is the optimal solution? Show the procedure roughly 3 -> 5 >> done. c) [4] For the following algorithms, categorize them into two groups and describe the main difference between two groups. Greedy Heuristics, Tabu Search, Genetic algorithm, Local-search, Simulated Annealing Greedy Heuristics, Local-scarch / Tabu Search, Genetic algorithm, Simulated Annealing Move only when better lill move always regardless of better/worse