Exercise $4$: Finding the shortest path

Suggested time: $30$ minutes

Find the shortest path from vertex $A$ to vertex $F$ in the figure below by using the diagram that has the nodes with three fields: label, cost and predecessor. Use a table below.

$\backslash$table$[[$Vertex label,Path cost$]]$

$\backslash$table$[[$frontVertix$,$vertixQueue $($front to back$)],[,],[,],[,],[,],[,],[,],[,],[,],[,],[,]]$