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 x as the source.

BFS: The Algorithm BFS (G, s) i for each vertex u E VIGJ (s) do color [u WHITE dluj [uj NIL 5 color[s] GRAY d[s] 7 TDs] NIL. 9 ENQUEU ECO, s) 1O while Q 11 do u DEQUEUE (Q) 12 for each v E Adj 13 do if color [v] WHITE 14 then color[v] GRAY 15 16 17 ENQUEUECQ, v) color [u] BLACK 18