Consider the following linear program. Max $1$A $+2$B s$.$t $1$A$<=41$B$<=32$A $+2$B $=10$ A$,$ B $>=0($a$)$ Show the feasible region. $($b$)$ What are the extreme points of the feasible region? $($b$)$ What are the extreme points of the feasible region? smaller x$-$value $($A$,$ B$)=(\_\_\_\_\_\_)$ larger x$-$value $($A$,$B$)=(\_\_\_\_\_)($c$)$ Find the optimal solution using the graphical procedure. $($A$,$ B$)=(\_\_\_\_\_\_)$ Consider the following linear program.

$[$ Max $1$ A$+2$ B; s$.$t$.$; $1$ A $<=4$; $1$ B $<=3$; $2$ A$+2$ B$=10$; A$,$ B $>=0]$

$($b$)$ What are the extreme points of the feasible region? smaller x$-$value $($A$,$ B$)=$ larger x$-$value

$($A$,$ B$)=($

$($c$)$ Find the optimal solution using the graphical procedure.

$($A$,$ B$)=($