Linear programming duality problem

[Advertiser]

Hello, I have a following linear programming problem:

I need to solve this using dual method graphical solution. Okay, first I must follow the following set of rules:

The first rule is the original problem and the second rule is it's dual form. And my problem is in same form as rule number 1. Therefore I must transpose my original problem's matrix: A =

-1	-1	2	-1
4	-3	3	-3

and it's transpose matrix:

-1	4
-1	-3
2	3
-1	-3

So the dual problem comes as this:

w = 2y₁ + 4y₂ -> min
-y₁ + 4y₂ >= 8
-y₁ - 3y₂ >= -7
2y₁ + 3y₂ >= -5
-y₁ - 3y₂ >= -1

Now what I have to do is to draw those constraints on 2D graph and determine the optimal solution for this dual task and also use it
to solve the original problem. But the problem is that I cant solve this dual task and I cant seem to find no optimal solution for such dual task.
Please help, thank you.