1. (No Computer Code. Tabu Search) Assume that you want to use Tabu Search to find the maximum of the polynomial F(X):X3-60X2 +90): , 0531531 Eqn (1) (where X is an integer expressed in base 10) Now assume you want to use Tabu Search with a binary decision variable to solve the problem. So you will need to be able to compute the value of F(X) using the base 2 number 2 that is equivalent to x (e.g. X28 has a base 2 equivalent of. z: 1000). Assume you cannot exceed more than 200 cost evaluations of F(X). a. How many bits do you need in your binary string for this problem? Why? b. How would you define a neighborhood for Tabu Search? (There is more than one correct answer for this, but pick a choice that has a neighborhood that has fewer than 6 members)