NumPy allowed · plain Python earns 10 bonus points
Implement supervisor-worker routing, the decision logic behind a real supervisor-pattern multi-agent graph directing each incoming task to the right specialist worker node.
Implement supervisor_route(task_category, worker_specialties, default_worker). Find the first worker (checking worker_specialties keys in sorted order for determinism) whose specialty list contains task_category. Return that worker's name, or default_worker if none match.
supervisor_route(task_category: str, worker_specialties: dict[str, list[str]], default_worker: str) -> str