I think answer is option A. But given option B.
The number of colors needed to edge color a simple graph is either its maximum degree Δ or Δ+1.
Vizing's theorem