Problem $3(30$ points$)$

Consider the following linear programming problem $P$ and its dual $D$ :

Let $x_3,x_4,$ and $x_5$ denote the slack variables of the respective functional primal constraints and $y_4$ and ys denote the surplus variables of the respective dual constraints.