For the below path finding problem $,$ if the goal is for the robot to search for path to reach the goal$($location of lock$),$ answer the below questions:

Define the PEAS description

For given problem $,$ for each of the type of dimensions of the task environment $,$ suggest your own case study in no more $30$ words a scenario, suitable to define such types of the task environment

Which agent architecture is best suitable to each of your above scenarios that you have designed in previous question? Justify in short answer.

Assuming deterministic, static, fully observable $,$ single agent task environment:

Suggest atleast $2$ suitable path cost g$($n$)$ to quantify the effort of search in reaching the current node $\text{'}$n$\text{'}$ from the start node.

Suggest atleast $2$ suitable heuristic cost h$($n$)$ to quantify the effort required by agent to reach goal node from the current node $\text{'}$n$\text{'}.$