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.
Step-by-step explanation:
angle Q will be 34° as the triangle is isosceles triangle.
The two numbers are 6 and 3
Answer:
f(x) = x^(1/2) + 3
Step-by-step explanation:
Translating to the right 3 units would change these:
0^(1/2) = 0 /// 3 units to the right would be (0,3)
1^(1/2) = 1 //// 3 units to the right would be (1,4)
4^(1/2) = 2 //// 3 units to the right would be (4,5) etc