this is actually Operation Research. Plis answer all im waiting

Question 1 The procedure for starting Linear Programming with (=) and (>=) constraint is to use artificial variables that play the role of slacks at the first iteration, and then dispose of them legitimately at a later iteration. Not yet answered Marked out of 1.00 P Flag question Select one: True False The right hand side of the primal constraint equations are equal to the objective coeficients of the dual. Quektion 2 Not yet answered Marked out of 1.00 P Flag question Select one: True False The procedure for obtaining the simultaneous solution of a system of linear equations is called the Gauss-Jordan method of elimination, or Gaussian elimination Question 3 Not yet answered Marked out of 1.00 P Flag question Select one: True False If the primal objetive is minimization, then it is true when the dual objective is also minimization Question 4 Not yet answered Marked out of 1.00 P Flag question Select one: True False From the model in the table below, determine a starting basic feasible solution by least cost method. The total cost resulted from the starting basic feasible solution is Question 5 Not yet answered Marked out of 1.00 P Flag question 0 6 2 9 1 4 7 8 12 5 14 3 4 11 3 9 9 10 Select one: a. 18 b.135 c. 39 d. 81 e. 93