please help me answer this question as thorough as possible

Problem 2. (5 points) Consider the following linear program: MaxZ=s.t.2x12x2+3x3x1+x2+x34,(resource1)2x1x2+x32,(resource2)x1+x2+3x312,(resource3)x1,x2,x30. Let x,x5, and x6 are the slack variables of the constraints of resources 1,2 , and 3 respectively. Given the optimal basic variables are x2,x3, and x6, and the corresponding basic matrix and its inverse are: 1/21/221/21/21001=1111130011. I. (3 points) Compute shadow prices of all three resources via the LP and the matrix given above only. II. (2 points) Using the result obtained in (I) to indicate which resource to increase capacity (the right-hand-side values of constraints) such that the objective value increased most