Consider a warehouse location and store assignment problem$().$ Cost of opening Warehouse$-1$ is $$5000$ and cost of opening Warehouse$-2($or$)3$ is $$10000.$ The transportation cost $($in $100$s$)$ for every pair of warehouse and store is given in the following table:

Warehouse

Stores $1234$

$1493121010155385910$

$7)$ Consider problem $().$ Let $[1,1,0]$ represent warehouses $1$ and $2$ are open. A neighborhood here is defined as a solution in which the status of only one warehouse is flipped $(1$ to $0,$ or $0$ to $1).$ How many immediate neighbors do we have for $[1,1,0].$

A$1$ C$3$ B$2$ D$4$

$8)$ Consider problem $().$ The total cost for $[1,1,0]$ will be

A $16700$ C $28700$ B $32680$ D None.

$9)$ Consider problem $().$ For $[1,1,0]$ Which of the following is a neighbor:

A $[1,0,1]$ C $[0,1,1]$ B $[,,]$ D None.

$10)$ Consider problem $().$ If flipping warehouse$-1$ is tabu. Then how many neighbors can we have for any current solution?

A$1$ C$3$

B $2$ D None