Prim's Algorithm is being applied to generate a minimal spanning tree. Vertices happen to be listed in G so that Prim's algorithm starts at vertex B$.$ After several iterations, edges $($B$,$ C$),($B$,$ E$)$ and $($C$,$ D$)$ have been added to the minimal spanning tree $($MST$).$ Which edge will the algorithm add to the MST next?