its urgent if possible i need the answers in two hours please.

Problem 3: 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 two square up or down (ex: if the token (x) in (1,2) goes to right, it should also either go to (3,0) or (3,4)) Two squares left which has to follow with two square up or down Two squares up which has to follow with two square right or left Two squares down which has to follow with two square right or left 0 1 2 3 4 5 6 a U W NO 4 5 a) Provide an admissible heuristic, means it should be admissible for a given any start state to any goal state (example below). Please provide your heuristic like a formula and then explain the formula if it is needed with an example (not more than 2 sentences) (10 points) EX: 0 1 2 3 4 5 6 1 2 3 4 5 6 G 0 1 2 3 S 4 5 6 (in the example the first grid is a start state and the second grid is a goal state)| b) Independent than the above problem. Assume that for any game, the actual cost from start state to the goal state is 100. You have two non-admissible heuristics which al have an estimate 110 and a2 has an estimate 120. Which one of the two non- admissible heuristics would you choose to use in your algorithm for a better solution? Explain the reason in two sentences (answer with no explanation will not get any point) (10 points)