1 of 2 Objective: Develop an AI agent that can navigate a grid-based board game called "Treasure Hunt" to find hidden treasures while avoiding obstacles and traps. Game Description: The game board is a grid (e.g., 10x10) where each cell can be: An empty space An obstacle A treasure Players start at a fixed position and aim to collect as many treasures as possible with the least number of moves. . Part 1: Uninformed Search - Basic Treasure Hunt Implement an AI agent that uses Breadth-First Search (BFS) or Depth-First Search (DFS) to navigate the board and find a path that collects a treasure. Fall 2023/2024 Tasks: O Initialize the game board from a given matrix. o Implement BFS or DFS to explore the board: . Start from the starting position. Treasure Hunt Game . Part 2: Informed Search - Guided Treasure Hunt Enhance the AI agent to use the A* search algorithm to find the most efficient path to collect treasures. Tasks: Explore all possible moves (UP, DOWN, LEFT, RIGHT) while avoid