12. We are implementing Tabu List on a six-city problem with a list size of 4 and a home city of A. Assume that all tours must start (and end) at city A. The current solution is ABCDEFA. Our tabu list includes the last 4 edges we've added: {CD,FA,BC,EF}. Moves that would require removing BOTH edges on the list are tabu. We are using the subtour reversal algorithm to define our neighborhood. Given the current solution and tabu list, identify all neighboring solutions and which of theee wnuld ha tahin (o non)