Answer:
35
Step-by-step explanation:
.54 can be rounded up to 1
So, 34.54 would become 35
Answer:
<h2>
</h2>
Step-by-step explanation:
<h3>Hope it is helpful....</h3>
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).
Step-by-step explanation:
draw it through the center to form the simplest line if that helps :)
The answer is D) SSS.
We have 3 pairs of congruent sides from each triangles, including the shared side.
Have an awesome day! :)