In the given graph, how many intermediate vertices are required to travel from node a to node e at a minimum cost?

• A. 2
• B. 0
• C. 1
• D. 3