In graph theory, to ensure a graph remains fully traversable after removing edges, what is the maximum number of edges that can be removed from a graph initially containing 1579 edges?
A) 1578.
B) 789.
C) 789.5.
D) 0.