Find an Exit in a URL Maze

A maze is represented as a directed graph of rooms, where each room is identified by a URL string. You are given a starting room, a list of rooms that are exits, and a list of directed edges between rooms. Your job is to determine whether any exit room can be reached from the starting room. Implement the function solution(start_url, exits, edges). The method must perform a breadth-first search starting at start_url, expanding outgoing edges in the exact order they appear in…