Answer:
The maximum profit is reached with 4 deluxe units and 6 economy units.
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.