Figure out the constraints:
Let D=desktop and L=Laptop
2. (Time available)
Draw the first three constraints on the graph and find the feasible region.
Put the corner values of the feasible region in the profit equation to find the combination that gives the highest profit!