Question $1$

$$ SUBMITTED

$2$ points

Apply Dijkstra's algorithm to the graph below starting from vertex A $.$

Enter the predecessor and distance arrays after the initialization pass. The distance array should be first, with spaces between each entry, and the predecessor array should be second. Use a capital I for infinity. For example:

$0102030401$

AFBDEC

Enter the arrays after the initialization phase.