(10 pts) Show the d and values that result from running BFS on the directed graph of Figure 22.3 (Lecture slides on basic graph algorithms, part I, page 21), using vertex t as the source.

wr 2 2 (D 2 2 2 3 3 2 3 3 Ch) 3 Figure 22.3 The operation of BFS on an undirected graph. Tree edges are shown shaded as they are produced by BFS. Within each vertex u is shown du. The queue O is shown at the beginning of each iteration of the while loop of lines 10-18. Vertex distances are shown next to vertices in the queue