$"$C$++$Whic XD$02$ h statement would replace XXX if the following loop is used to initialize all vertices' distances to infinity $($$)$ using Dijkstra's algorithm?

for each vertex currentV in graph $\{$

currentV$$distance $=$ Infinity

currentV$$predV $=0$

XXX

$\}$

A$)$ Pop currentV to unvisitedQueue

B$)$ Push currentV to unvisitedQueue

C$)$ Push predV to unvisitedQueue

D$)$ Pop predV to unvisitedQueue"