Please help and show work.

A. Describe the lower bound for an integer programming problem not solved to the solution? optimal B. what can be the results for solving an integer programi you give the computer a fixed amount of time (such as 1 hour)? C. Solve this knapsack problem via branch and bound by hand. min 2x1 + 3x2+6 x3 +11 x4 st: 3x1 +5 x2+5 x3 +6 x4> 11 A. Describe the lower bound for an integer programming problem not solved to the solution? optimal B. what can be the results for solving an integer programi you give the computer a fixed amount of time (such as 1 hour)? C. Solve this knapsack problem via branch and bound by hand. min 2x1 + 3x2+6 x3 +11 x4 st: 3x1 +5 x2+5 x3 +6 x4> 11