Linear programming problem

A machine shop makes Axle P and Axle Q. Each axle is fabricated by cutting, grinding, and turning operations. The hours of labor required to fabricate these axles are shown in the following table:

The profits from the sale of Axles P and Q are $\$10$ and $\$8$ respectively. Let $x$ and $y$ represent the units of Axles P and Q to be fabricated.

The objective function for this problem is:

$Maximize \ z = Q_1x + Q_2y$

The cutting operation constraint is:

$A_1x + A_2y \le D$

The grinding operation constraint is:

$B_1x + B_2y \le E$

The turning operation constraint is:

$C_1x + C_2y \le F$

Provide the correct values for $Q_1$, $A_1$, $B_2$, $C_2$, $D$ and $F$.

Output format:

10 20 30 40 50 60