$5.(5$ points$)$ Consider the following directed graph $\backslash ($ G $\backslash )$ :

$8$

$($a$)(5$ points$)$ Using Dijkstra's algorithm, find the shortest path from D to C$.$ Show how the table updates over time. For example, consider the following table as a template:

Afterwards, write the path you found.