You want to develop a Tabu Search algorithm for the Asymmetrical Traveling Salesman Problem with cities. You define your neighborhood as the 1-opt move. Given an initial solution, you will search the neighborhood in a random order and choose as the next solution the first non-tabu move that improves the tour length. You will continue running the algorithm until no improvement is found. a. What is the worst case complexity of this search strategy in the order of n)? b. Propose two alternative tabu list representations for this neighborhood move. Which one is more restrictive? Why? c. Describe how you can keep track of recency (medium-term) and frequency (long-term) memories in your algorithm. d. Propose a diversification and an intensification strategy based on the recency and frequency memories you defined in part c