Table 11-9 Maximize Z = 34 X 1 + 43X 2 + 29X 3 Subject to: 5 X1 +4X2 + 7X 3 50 1 X 1 + 2 X 2 + 2X 3 16 3 X 1 + 4 X 2 + 1X 3 9 All X i are integer and non-negative Final Integer Solution Z = 208 Decision Variable Solution X 11 X20 X 36 Table 11-9 represents a solution for an integer programming problem. If this problem had been solved as a simple linear programming problem, what would you expect the value of the objective function to be? a. less than 208 b. greater than 208 c. exactly 208 d.(a) or (c) e. (b) or (c)