Linear programming problem

Two towns (P and Q) depend on two farms (A and B) for their weekly supply of staples. The weekly requirements for P and Q are 6 and10 tons respectively. The weekly production capacity of A is 9 tons while that of B is 7 tons. The cost of transporting the staples from both farms to the towns are:

The amount of staples transported from the farms to the towns are:

The goal is to minimize the cost of transporting the staples from the farms to the towns.

The objective function of the above LPP is:

$Minimize \ z = C_1x_{ap} + C_2x_{aq} +C_3x_{bp} + C_4x_{bq}$

The production capacity constraints for A is:

$x_{ap} + x_{aq} = D_1$

The production capacity constraints for B is:

$x_{bp} + x_{bq} = D_2$

The weekly requirement for town P is:

$x_{ap} + x_{bp} = E_1$

The weekly requirement for town Q is:

$x_{aq} + x_{bq} = E_2$

Find the values of $C_1, C_2, C_3, C_4, D_1, D_2, E_1, E_2$

Output format:

2 2 3 3 5 5 6 6