Please answer the question in my given form, there should be total 8 answers.

2. (20pts) Consider the following graph G-(V, E) weighted by w: E- Z+: V-la, b, c, d, e, f, g, h The edge set E is defined by the positive weight w satisfying the above Run Dijkstra's algorithm on G following the class convention: blue color means "in the middle of process"; red color means "finished"; always choose alphabetically the earliest one within the rules So the start node should be a. Define the finish rank of a node as follows: that of a is 1 because it is colored in red first. The node colored in red next has the finishing rank 2. The ith node colored in red while is the algorithm is running has the finishing rank i Answer the two questions (i) What is the shortest distance from a to e? (i) Find the finish ranks of the nodes b to h. Answer choices: (1)1, (2) 2, (3) 3, (4) 4, (5) 5, (6) 6, (7) 7, (8) 8, (9) 9, (10 None of the above