Write the Board method check(). check() will use recursion to check to see if this board is winnable or not winnable. Check() will always start checking at the S. check() is always passed in the coordinates of S. check() will look to see if an unobstructed path exists from S to X.

The initial tableau of a linear programming problem is given. use the simplex method to solve it. x 1 x 2 x 3 s 1 s 2 z 1 2 4 1 0 0 8 3 4 1 0 1 0 10 minus3 minus12 1 0 0 1 0 the maximum is nothing when x 1equals nothing, x 2equals nothing, x 3equals nothing, s 1equals3, and s 2equals0. (be sure to simplify to lowest terms if necessary.)