Devise a hill climbing search based approach to solve N-city TSPs. You must define all required elements to be able to implement the hill climbing search as indicated in the pseudocode of this algorithm including the state description (representation of the problem), the initial state, the successor function and applicable actions, the goal test or the goal state, and the heuristic function h. Strive for an evaluation or heuristic function definition that facilitates optimal solutions. Describe the pseudocode for the hill climbing algorithm adapted for the TSP. There is no need to implement the search algorithm.