Tasks:
Given the following graph with nodes and edges (edges represent the distances between the nodes):
(1) Find the shortest path between nodes 0 and 6 using Dijkstra's shortest path algorithm.
(2) Evaluate the time complexity of your algorithm.
Note: Solve this task manually. Provide detailed description of your steps, not just final result. For each step, show your decision, calculations and provide visual interpretations on the graphs image as well.