A company has decided to use $0-1$ integer programming to help make some investment decisions. There are three possible investment alternatives from which to choose, but if it is decided that a particular alternative is to be selected, the entire cost of that alternative will be incurred $($i$.$e$.,$ it is impossible to build one$-$half of a factory$).$ The integer programming model is as follows:

Maximize$5000X11+70002+90003$

Subject $to$: $x1+x2+x32(only2$ may $be$ chosen$)$

$250001+320002+29000362,000(budgetlimit)$

$161+14x2+19336(resourcelimitation)$

all variables $=0or1$

Subject to: $x1+x2+x32($only $2$ may be chosen$)$

all variables $=0$ or $1$

whereX$1=1$ if alternative $1$ is selected, $0$ otherwise

$x2=1$ if alternative $2$ is selected, $0$ otherwise

$x3=1$ if alternative $3$ is selected, $0$ otherwise

Solve the problem using the Excel Template provided in Module $6$ Brightspace

According to Table $10-1,$ which presents an integer programming problem, if the optimal solution is used, what would the value of the objective function be$?$