How to apply Simplex Algorithm to the following Linear Program:

Minimize C = 4x + 5y

s.t.

x+2y >= 10

2x +3y >= 18

x>= 0, y>=0

______________________

Here is where I get stuck...

So to apply simplex, we have to convert this to a Maximization function first and add slack variables which gives us:

Maximize C = -4x - 5y

s.t.

x + 2y -s = 10

2x + 3y - t = 18

________________________

Then I convert this to the following tableau:

	x	y	s	t	c	Ans
s	1	2	-1	0	0	10
t	2	3	0	-1	0	18
c	4	5	0	0	1	0

Now looking at the above tableau, the bottom row contains all positive numbers... And according to the material I read, this means it is in optimal form already... I am confused what to do in this case... Can you explain?