Please fill the graph and answer for part a and b thank you.

(1.5 points) Suppose we wanted to find a single-source shortest path tree for the graph below, starting at s, such as one that would be output by Dijkstra's Algorithm. There are two (2) questions after the graph. v intree(v) parent(v) dist(v) N/A 0 b S d e f g h 18 6 11 5 9 S h 7.5 13 8 5 d f 6 3 12 (a) What is parent(9) in the completed chart? (b) What is the shortest path from s to h? Write only the vertex labels in the answer form (e.g., if you believe the path is s +b+c+9+h (which it isn't), you would write "sbcgh" in the answer form, not "s-> b->c->g->h" or anything like that)