Ateenager pulls a rope to the left with a force of 12 n. a child pulls on the other end of the rope to the right with a force of 7 n. the child's firend adds a force of 8 n, also pulling to the right. what will happen?
a. the net force will be 3 n to the right
b. the net force will be 15 n to the left
c. the net force will be 12 n to the right
d. the net force will be 27 n to the left

Two rectangular prisms have the same volume. the area of the base of the blue prism is 418 4 1 8 square units. the area of the base of the red prism is one-half that of the blue prism. which statement is true?

The height of a birch tree, f(x), in inches, after x months is shown in the graph below. how much does the birch tree grow per month, and what will be the height of the birch tree after 10 months? a. the birch tree grows 1 inch per month. the height of the birch tree will be 16 inches after 10 months. b. the birch tree grows 2 inches per month. the height of the birch tree will be 26 inches after 10 months. c. the birch tree grows 3 inches per month. the height of the birch tree will be 36 inches after 10 months. d. the birch tree grows 2 inches per month. the height of the birch tree will be 24 inches after 10 months.

Acaterer knows he will need 60, 50, 80, 40 and 50 dinner napkins on five successive evenings. he can purchase new napkins initially at 25 cents each, after which he can have dirty napkins laundered by a fast one-day laundry service (i. e., dirty napkins given at the end of the day will be ready for use the following day) at 15 cents each, or by a slow two-day service at 8 cents each or both. the caterer wants to know how many napkins he should purchase initially and how many dirty napkins should be laundered by fast and slow service on each of the days in order to minimize his total costs. formulate the caterer’s problem as a linear program as follows (you must state any assumptions you make): a. define all variables clearly. how many are there? b. write out the constraints that must be satisfied, briefly explaining each. (do not simplify.) write out the objective function to be minimized. (do not simplify.)