Question # 02 Marks: 8 Suppose there is an agent which is a treasure hunter (*). It desires to collect gold coins ) in a maze like the one shown below. The agent is not directional and can move one step in any direction (n, s, e, w) at any time step, as long as there is no wall in the way. The gold coins do not move. The agent's goal is to find a plan for collecting all coins using as few moves as possible. Assume that the grid has size MxN and there are 4 coins in the maze. 1 2 4 Implement the given scenario using problem solving agent and formulate this problem as a search problem, i.e.: Design suitable representation of the search states? Design a method of initial state Set goal state Calculate path cost at each step