5. (4 pts) Given the below graph (on the right) and the adjacency list used to represent the graph, if we run BFS starting from node s, what would be the nodes that we will visit in order? adj(s) = { a, c, d } Answer: adj(a) = { } adj(c) = { e, b} adj(b) = { d } adj(d) = {c } adj(e) = { s }