Treating the above RTD Light Rail map as a connected graph where station names correspond to vertices in the graph, beginning at the Denver Airport and expanding nodes until you reach the Elitch Gardens, a popular Denver Amusement park, station, perform a breadth first search, depth$-$limited search with a limit of $6,$ and a bi$-$directional search using breadth$-$first at each expansion.

Please just write out the search in a manner that is easy to read and for each search, list the stations $($graph nodes$)$ in the order they are visited. In each case, you are demonstrating what is associated with each search. Thank you!