AI question Computer Science. Given a state space graph where $A$ is the start state and $G$ is the goal state. Each

edge has its own cost and can be traversed in both directions. Heuristics h$1$ and h$2$ are

also given where h$1$ is consistent but h$2$ is not.

a$)$ For each of the following strategies, mark which, if any, of the listed paths it could

return. $($Mark all paths that could be returned under some tie breaking condition.

iii. Assume that no values have been assigned to the variables and we are doing

the one iteration of forward checking. Write down the value$($s$)$ that will be

eliminated if we assign 'egg' to Adam. If no values will be eliminated, then write

'None'.

Value$($s$)$ that will be eliminated for Barb:

Value$($s$)$ that will be eliminated for Camellia:

Value$($s$)$ that will be eliminated for David: