4. For solving a linear programming problem by the Simplex method, it is necessary that any unrestricted variables are first replaced by non-negative variables. Mark the statement as T (True) or F (False).