Answer:
press their profile and there is a button that says add a message ill send you one.
Step-by-step explanation:
Answer:
The absolute maximum and minimum is
Step-by-step explanation:
We first check the critical points on the interior of the domain using the
first derivative test.


The only solution to this system of equations is the point (0, 4), which lies in the domain.


is a saddle point.
Boundary points - 
Along boundary 





Values of f(x) at these points.

Therefore, the absolute maximum and minimum is
The total number of gifts = x+y.
The inequality is:

Key chains cost $1, Magnets $0.50
Total Cost = x + 0.5y
Inequality is:

Without graphing you can solve system by using substitution:

This is one solution where the maximum x value is given.
So the most keychains that can be purchased is 16. However, because magnets are cheaper, more can be purchased as long as cost remains under 20.
If you solve both inequalities for "y", you get the upper and lower bounds for how many magnets can be purchased given a quantity of keychains.

This is complete solution which gives all possible combinations.
(Graph is Attached)
Answer:
I think it's 1,125 and 4485
Step-by-step explanation:
25x13x3
115x13x3