Pacman hasn’t had much to do recently, so he’s been playing games of Solitaire on his own to pass the time. Unfortunately, he’s not very good at it. In order to help himself get better, Pacman tries to model this question as a search problem with the states being any configuration of cards. The cost of edges between states, modeled by function c, is the number of moves closer Pacman gets to winning. An optimal cost-to-go function, h ∗ , will tell Pacman how many moves away from winning he is given any state. Given h ∗ , design an admissible but inconsistent heuristic h and prove that it is indeed admissible but inconsistent. NOTE: you do not need to understand Solitaire to solve this problem. (However, and only if it helps you formulate your solution, you may answer this question for any Solitaire variant or rule set of your choosing.)