Consider the following pseudocode for the edge coloring problem of a graph. Which of the following best suits the blank?

Start traversing the graph using BFS traversal 
Pick up any vertex from the graph  
__________________________  
Traverse one its edges 
Repeat until all the edges of the graph are covered

A. Assign different colors to all the adjacent vertices

B. Delete all the connected edges

C. Assign a color to only one of its edge

D. Assign different colors to the connected edges, and mark those edges as colored

Answer: Option D