Suppose we wish to use algorithm A* to solve instances of the travelling salesperson problem. (a) (15 points) Give a representation of the general TSP problem stated above suitable for A* (that is, describe states and their representation, the initial state, the goal state or goal condition, and the neighbour rules - how to generate neighbours of a node - and their cost). You can use the small example above to illustrate your representation, but your representation must be applicable to any (complete) TSP. You can use the letters W,B,G,H,T to refer to the cities by their first letter if you use the small example above.