Solve the following integer programming problem using branch and bound approach. Maximize Profit = $2X1 + $3X2 Subject to : X1+ 3X2<9 3X1 + X237 X1 - X2< 1 Where both X1 and X2 must be nonnegative integer values.

Graph the following inequalities on a number line 12) 12 (1/4 + x/3) > 15   13) -3 (4x - 8 ) > 2( 3 + 2x)

What is the end behavior of each of the following 1. y = -4x3 + 2x? + 7 2. y = 2x - 3x* + 4 3. y = -x³ + 2x5 – 1 4. y =Ox (x - 7)(x + 5)* (55 y = x(x + 1)(x - 8)

If there are three kinds of cat food an experimenter will be feeding to cats and measueing the amount, they are feed, to then predict the number to active minutes the cat has in a day. They want to include the kind of cat food as a dummy variable. (a) Propose a scheme with 2 dummy variable in addition to the constant that would work and show it works? (b) Do the following propsed dummy variable schemes work? (show your work)

3. Jack and Jill work at the same store. Jack's total weekly salary, in dollars, if he sells x items is given by S= = 100 + 5x, and Jill's total weekly salary, in dollars, if she sells x items is given by S = 80 + 6x. If they sell the same number of items in a week, what is the minimum number of items they have to sell so that Jill's weekly salary is at least $300 more than Jack's? Ver