Problem 3. (25 points) For each of the problems, (1) state what algorithm you think is best search from uninformed and informed searches. Provide a specific search algorithm and not just one of these categories. Then (2) justify your answer with a short paragraph (one to three sentences) why you think this is the most appropriate choice. (1) An airplane carrying plutonium crashed into the desert. You landed nearby with a bio-hazard suit and a Geiger counter. You need to find and retrieve the plutonium. (You can assume all the plutonium is together at the same spot.) You want to find the plutonium as quickly as possible. Both problems 2 and 3 relate to mazes, such as shown below: (2) Assume you want to make a computer program to highlight a path through a maze. The computer knows the whole maze, such as pictured above. You want to reach the goal in the shortest route possible. (3) Suppose you again want to reach the exit. However, the environment is only partially observable, so you can't see what are in the squares until your algorithm "explores them. Your goal is to find the shortest path to the exit