A comaany has decited to use $0-1$ integer progsan uing to help rake same investment decisians. There are thres ocrsible invesiment alternatives fram which to choose but if if is decided that a partisular altemative is in be selected the entire fictorn. The integer orograrming modet is as tol ows:

Maxinize$50001+700002+90003$

$250001+3200002+290003$ s $62,0007$ litheget limiti

$161+142+19336|$rescurce limitation$!$

al variasies $=0$ or $1$

aherex $1-1$ if stermative $1$ is selected, Co inthersise

$x_2-1$ if atemative $2$ is selected, $0$ utherwisp

$x3-1$ if aternation $9$ is seected, $0$ alherwise

Accorditic to Table $10-1,$ whith PCesents an integet programming prablem, if the optimal solution is dised whar mould the value of the object ve function be$?$

$2$