Consider a mixed integer programming model which includes binary decision variables bi$,$j

indicating whether or not stand i is entirely harvested in period j$.$ A value of $1$ means that

the stand is harvested; a value of $0$ means that it is not. Suppose that stands $2,5,6,$ and $8$

are considered to be adjacent, and you wish to ensure that no more than one of these

stands is harvested in the same period. Write out a set of adjacency constraints that will

ensure that this requirement is satisfied for each period in a $3-$period planning horizon.