Problem 2: You are given a game which has the following rules: You have a single token x, and it can move, .Two squares right which has to follow with 1 square up or down (ex: if the token (x) in (2,3) goes to right, it should also either go to (4,2) or (4,4)) Two squares left which has to follow with I square up or down . Two squares up which has to follow with 1 square right or left .Two squares down which has to follow with 1 square right or left Provide an admissible heuristic, means it should be admissible for a given any start state to any goal state Please provide your heuristic like a formula and prove/explain why it is admissible.(15 points) Ex: in below example the token can go from start to goal state in two moves 61234 56 b) Does the environment for the above game is accessible or inaccessible? Explain with your reason?(single word won't get any point )(5 pts)