Please fill in the blanks with the appropriate statement. $(20$ pts$)$ a$)$ q$,$ are the entities whose values are to be determined from the solution of the Linear Programming Problem. b$)$ An LP can be solved graphically $(2-$dimensional$)$ as long as number of decison variables lower than or equal to q$,$ c$)$ An optimization problem is linear as long as q$,$ d$)$ The contribution of each decision variable to the objective function is proportional to the value of decision variable is q$,$ assumption. e$)$ q$,$ is a mathematical technique used to solve the problem of allocating limited resources among the competing activities. f$)$ In graphical representation, the bounded region is known as q$,$ region. g$)$ A q$,$ variable indicates how much a constraint is over satisfied. h$)$ LP$\text{'}$s optimal solution should also be q$,$ solution. i$)$ In an alternative optimal solution case, isoprofit$/$isocost line leaves the feasible region q$,$ rather than a single point. j$)$ Constraints are called as q$,$ in which Right and Left hand sides are different from each other in the solution.