can you explain (2) True or False Questions?

(1). The following is a tableau for an LP which is a MIN problem: (a). Fill in the value of each variable: e1=,s2=,e3=,x1=,x2=, (b). Which of the variables are basic? (c). This is not an optimal BFS. Which variable should be selected to enter the basis? (d). For your choice of entering variable, which variable leaves the basis? (e). What is the next tableau? (2). For each of the following state True or False: (a). A minimization LP can not be unbounded. (b). An LP that has a degenerate BFS must have all BFS degenerate. (c). At the end of the Simplex method, all slack variables must be non basic. (d). If the objective function remains the same after an iteration of the Simplex method, the BFS must be degenerate. (e). At each iteration of the Simplex method the objective function remains the same or strictly improves