Answer Happy

Help, so here is the question, I have started the question but I
keep getting the wrong answer according to graphing the question. I
have attached my work, and im not sure where I went wrong. If you
correct my work, or show step by step similarly to my steps
how you would solve it. THANK YOU
Solve the following LP optimization problem using the simplex
method: maximize 40𝑥 + 30𝑦
subject to 𝑥 + 𝑦 ≤ 12,
2𝑥 + 𝑦 ≤ 16,
𝑥 ≥ 0,
𝑦 ≥ 0
х 9 t 1 Y 1 1 -30 VOO x+y+q=12 2x+y+t=16 Z+-40x+-30y=0 NO O 1 oo C 12 16 0 2 -40 1 0 1 X 1 2 -40 Y 1 1 -30 OOO OO HOON 0 0 1 C 12 16 0 12/1=12 16/2=8 most negative # ܐ х 1 1 -40 C 12 Y 1 0.5 -30 OOO t 0 0.5 0 WOO 0 0 1 make row above and below zero O 0 х t C 4 r1-r2->r1 XOO 0 1 0 V 0.5 0.5 -10 OOO -0.5 0.5 20 HOON 0 0 1 oo 8 320 r3+40r2 х C 4 starting next iteration XOO Y 0.5 0.5 -10 OOO t -0.5 0.5 20 NO O 8 16 1 0 8 320 1 C y 1 4 XOO OOH BANO t -1 1 10 NOO -1 20 6 360 r2-1/2r1 r3+10r1 0 1