data structures and algo c++ dry runs

(7 marks) The Breadth Firtst Traversal (BFT) is also used for creating a shortest path tree. The shortest path tree is represented with an array (Parent array) in the program. Write down the contents of this Parent array for the following graph, if the BFT traversal starts from vertex 17 d. (5 marks) Given the following graph, use Dijkstra's algorithm to find out the shortest path tree from vertex 0 . Show the values of smallestWeight array after every iteration, and contents of the parent array as well in the end. Show smallestweight array contents after every iteration