Quiz: Lexicographic Euler Path

You need the lexicographically smallest Euler path. How do you modify Hierholzer's algorithm to achieve this?

1. A.Sort all edges globally before starting the algorithm
2. B.Use BFS instead of DFS to prioritize shorter paths
3. C.Run the algorithm multiple times and pick the smallest result
4. D.At each node, always pick the lexicographically smallest unused neighbor