If a graph has v vertices and e edges then to obtain a spanning tree we have to delete? (A) v edges (B) v – e + 5 edges (C) v + e edges (D) None of these►Correct Option Correct Option is: D