Q3: Based on the key-based weighted graph below, please apply Dijkstra's algorithm to search the shortest path starting from node A. 1). Show each step by table and, at each step,

the calculation and the two sets of nodes and distances; one set for which shortest distances have been determined and the other set of the remaining nodes and distances. (20%) 2). Analyse the complexity of Dijkstra's algorithm. (5%) B x6 XO 8 x7 A x1 x2 C F 77 x3 x4 E x8 x5 D D