$1.$ For the graph given, find 'shortest path length' and 'shortest path' using Dijkstra's algorithm. $($Solve by hands$)$

$($Express 'shortest path' in the same format as A$->$B$...->$C$.)$

$2.$ Implement Dijkstra's algorithm in python, and make sure the above solution is correct.

$($Attach the Python code and the execution result.$)$