Given below is the pseudocode of the dominating set problem. Which of the following best suits the blank?

Dominant(G = (V, E))
{
    D = { }
    while (E!=0)
    {
        pick any edge e connecting to vertices X and Y
        add one vertex between X and Y to set D
        ________________
    }
    return D;
}

A. delete all the edges connected to X

B. add all the edge connected to X

C. delete X

D. delete adjacent edge

Answer: Option A