Considering the following final simplex tableau for a product-mix maximizing problem:

			4	3	0	0
C	Pmix	Quan	X1	X2	S1	S2
4	X1	3/2	1	0	-1/4	3/4
3	X2	1	0	1	1/2	-1/2
	Z	9	4	3	0.5	1.5
	C-Z		0	0	-0.5	-1.5

Required:

1. Find the integer programming solution to this problem by conducting Gromory cutting plane Method
2. Explain briefly each coefficient computed in part 1.
3. Why should such concept be used? Explain briefly.