The FAT method . a. keeps information about the block where bit vector is stored.
b. employs space maps to manage information about free blocks.
c. does not store information about free blocks.
d. incorporates free-block accounting into the allocation data structure.

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.)