What is the answer for this

4.8 is x

Step-by-step explanation:

Answer:

Angle Bisector

Step-by-step explanation:

In general, you solve a problem like this by identifying the vertices of the feasible region. Graphing is often a good way to do it, or you can solve the equations pairwise to identify the x- and y-values that are at the limits of the region.

In the attached graph, the solution spaces of the last two constraints are shown in red and blue, and their overlap is shown in purple. Hence the vertices of the feasible region are the vertices of the purple area: (0, 0), (0, 1), (1.5, 1.5), and (3, 0).

The signs of the variables in the contraint function (+ for x, - for y) tell you that to maximize C, you want to make y as small as possible, while making x as large as possible at the same time. The solution space vertex that does that is (3, 0).

To solve a problem like this, we can identify the vertices of the feasible region.

The vertex that satisfies this is (3, 0). Therefore, the maximum value of C is 3.

What is the Feasible Region?

The feasible region is the area where all the constraints are satisfied. In this case, the feasible region is the purple area in the graph. The vertices of the feasible region are (0, 0), (0, 1), (1.5, 1.5), and (3, 0).

To maximize C, we want to make y as small as possible and x as large as possible. The vertex that satisfies this is (3, 0). Therefore, the maximum value of C is 3.

Read more about vertex here:

brainly.com/question/21191648

#SPJ4

36 apples, 24 oranges

For this, each 'group' contains 5 fruits; three are apples; two are oranges. Take 60/5 is 12. then multiply 12 by each number of apples and oranges in each group, getting 36 apples and 24 oranges.