1) The snail (Agent 1) and the unicorn (Agent 2) are best friends but are trapped in a maze such as the one below. To not feel too alone they want to meet up they do not care where, but they want to meet in as few turns as possible. At each turn both move at the same time, and each of them moves exactly one square up, down, left or right.

Neither of them can enter (or jump over) any walls (i.e., the black squares), but they have GPS and mobile phones, so they know where each other is and can cooperate in finding the best path. Using a utility-based agent, write the pseudocode for the snail and unicorn to meet such that their path is the shortest one. Your pseudocode should clearly define the state, possible states, rules and action for every step, as well as describe the following functions namely: UPDATE-STATE, RULE-MATCH and ACTION