Given the following directed graph, what is the resulting final state after applying Dijkstra's algorithm starting at vertex $"2".$ Fill the table

$\backslash$table$[[$Vertex$,$Cost,$],[0,,],[1,,],[2,,],[3,,],[4,,],[5,,],[6,,],[7,,]]$