-In Figure 2a, Using the Shortest Route Algorithm Presented in the Text

-In Figure 2a, using the shortest route algorithm presented in the text book, the label and the node that would get the permanent label next, will be

A) 3 and $[5,2]$
B) 4 and $[8,2]$
C) 5 and $[7,1]$
D) 2and $[3,1]$