input: Write a python function to solve a linear programming problem using the Simplex Method.
  assert simplex_method([[1, 1, 1], [2, 1, 2], [2, 2, 1]], [4, 8, 8], [3, 2, 4]) == (4, [0, 4, 0])
  assert simplex_method([[1, 2], [4, 0], [0, 4]], [8, 16, 8], [3, 2]) == (12, [0, 2, 4])
  assert simplex_method([[2, 1], [1, 2]], [8, 8], [2, 3]) == (12, [0, 4])
output: from scipy.optimize import linprog
  
  def simplex_method(A, b, c):
      res = linprog(c, A_ub=A, b_ub=b, method='simplex')
      return -res.fun, res.x[:len(b)]