Your question is Shortest Path and Graph Traversal. Take a moment with it on the right.
Talk me through your thinking if you like. When you're confident, submit your answer and I'll grade it like a real screen (7/10 or better passes).
How would you solve shortest path problems and explain when you would use BFS or DFS on a graph?