The following linear programming problem hasMaxZ $=48$x$1+12\backslash$times $2$Subiect to:$4$x$1+2\backslash$times $21616$x$1+4\backslash$times $2324\backslash$times $1+8$x$264$X$27$X$1,$ X$20$Please choose the option that would best fit the empty space above: only one optimal solution multiple optimal solutions no solution, since it is infeasible no best solution, since it is unboundedNone of the above