Below is a simplex for a maximizotion type Lineor progrroming problem toble is included. Colculate necessay colublaion on this simplex toble and than onswer the questions below. a) According to this simplex toble, determine the volves of decision veriobles and idle veriobles. Provide necessory explanations for idle veriables, ond identity resource constroints, about for tamily. b) Colculote the volue of the obtective tunction according to this simplex toble. c) Is the oftimum solution obtained in this simplex toble? Exploin how you made your decision. d) If this simplex toble does not represent the optimum solution point; the next simplex toble shows the veriable that should be removed from the base veriobles and reploced by the base verioble specify the verioble that should be added to the veriables