Consider the following linear programming problem: Maximize $4$x$\_\{1\}+2$y$\_\{2\}$ Subject to: $4$x$\_\{1\}+2$y$\_\{2\}*$f $*40$; $2$x $1+$y $2$ f $20$; x $1,$ y $2^3$ O The above linear programming problem : exhibits unboundedness has more than one optimal solution exhibits infeasibility has only one optimal solution