Determine all vertices and extreme rays of the feasible region of $(P)$ by drawing its feasible region.

Using the extreme rays, argue that $(P)$ is unbounded.

Put problem $(P)$ in standard form. Find all basic solutions to this system; label them A$,$ B$,$ C$,$

$...$ Indicate these solutions $($using their labels$)$ on the figure you drew in Part $1.$

Use the simplex algorithm $($starting from the basis composed of slack variables$)$ to show that $(P)$ is

unbounded. When multiple variables are eligible to enter the basis, select the eligible variable with

highest reduced cost. If multiple variables are eligible to leave the basis, select the eligible variable

whose index is smallest. $($When providing an answer to this problem, report $($at least$)$ the simplex

dictionary obtained at each iteration, and state what variables are entering$/$leaving the basis.$)$

Represent the sequence of basic solutions you encountered during simplex on the figure you drew in

Part $1.$