6. Alice is an archaeologist exploring an ancient underground chamber filled with mysterious artifacts. The chamber is a complex network of interconnected rooms, with each room represented as a node in a graph. The goal is to find a particular artifact rumored to be hidden deep within the chamber. The chamber is full of surprises and dangers, and Alice needs to navigate it efficiently. She has two strategies at her disposal: Depth-First Search (DFS) and Breadth-First Search (BFS). Each strategy offers different advantages in different situations. Alice needs to decide which search strategy to use at each juncture in order to minimize the time it takes to find the hidden artifact. Design an algorithm to help Alice with the following tasks a. Determine the minimum number of steps required to reach the hidden artifact using both DFS and BFS. b. Calculate the number of steps taken for each strategy. B 2 3 1 A 1 3 5 F 2 H 4 E