Answer:
The maximum profit is reached with 4 deluxe units and 6 economy units.
Step-by-step explanation:
This is a linear programming problem.
We have to optimize a function (maximize profits). This function is given by:

being D: number of deluxe units, and E: number of economy units.
The restrictions are:
- Assembly hours: 
- Paint hours: 
Also, both quantities have to be positive:

We can solve graphically, but we can evaluate the points (D,E) where 2 or more restrictions are saturated (we know that one of this points we will have the maximum profit)

The maximum profit is reached with 4 deluxe units and 6 economy units.
We know that ∠1 equals ∠3, from that we can find x:

The sum of ∠1 and ∠2 must equal 180°:

Since we already know x, we can solve for y:

Result: x=10, y=6
The confidence interval formula is computed by:
Xbar ± Z s/ sqrt (n)
Where:
Xbar is the mean
Z is the z value
S is the standard deviation
N is the number of samples
So our given are:
90% confidence interval with a z value of 1.645
Sample size 40, 45
Mean 180, 179
Standard deviation 2, 4
So plugging that information in the data will give us a
confidence interval:
For 1:
Xbar ± Z s/ sqrt (n)
= 180 ± 1.645 (2 / sqrt (40))
= 180 ± 1.645 (0.316227766)
= 180 ± 0.520194675
= 179.48, 180.52
For 2:
Xbar ± Z s/ sqrt (n)
= 179 ± 1.645 (4 / sqrt (45))
<span>= 179 ± 1.645 (0.596284794)</span>
therefore, the answer is letter b
Answer:
and 
Step-by-step explanation:
we have

we know that
Compound inequality can be divided into two inequalities
so

rewrite

and

therefore
An equivalent form of the compound inequality is
and 