Please explain your answers for each part

2). True or False: (a). When using the branch and bound approach to solve an integer programming problem, the LP relaxation has x1 = = 2.9, and all other variables are integer. The branches added to the sub problems are xi 2. (b). The cutting plane method used to solve (pure) integer programming problems with n variables will always find an optimal solution after adding at most n cuts. (c). A knapsack problem is solved twice - once using integer programming and a second time using dynamic programming. Both solutions must be the same. (d). A (deterministic) dynamic programming problem must have a unique optimal solution. 2). True or False: (a). When using the branch and bound approach to solve an integer programming problem, the LP relaxation has x1 = = 2.9, and all other variables are integer. The branches added to the sub problems are xi 2. (b). The cutting plane method used to solve (pure) integer programming problems with n variables will always find an optimal solution after adding at most n cuts. (c). A knapsack problem is solved twice - once using integer programming and a second time using dynamic programming. Both solutions must be the same. (d). A (deterministic) dynamic programming problem must have a unique optimal solution