Q1.2 BFS-neighbors of a

List the neighbours of a in the BFS-tree in alphabetic order.

Q1.3 BFS-neighbors of b

List the neighbours of b in the BFS-tree in alphabetic order.

Q1.4 BFS-neighbors of d

List the neighbours of d in the BFS-tree in alphabetic order.

Q1.5 BFS-neighbors of f

List the neighbours of f in the BFS-tree in alphabetic order.

Q1.6 DFS sequence

Provide the ordering of the vertices as they are visited by a DFS. Your answer should be a string consisting of the letters a-j without separators. For instance, if you think that the vertices are visited in the order j,i,h,g,f,e,d,c,b,a, then your answer should be jihgfedcba.

Q1.7 DFS-neighbors of a

List the neighbours of a in the DFS-tree in alphabetic order.

Q1.8 DFS-neighbors of b

List the neighbours of b in the DFS-tree in alphabetic order.

Q1.9 DFS-neighbors of d

List the neighbours of d in the DFS-tree in alphabetic order.

Q1.10 DFS-neighbors of f

List the neighbours of f in the DFS-tree in alphabetic order.

Q1 Graph Iraversals: BFS and DFS 20 Points Execute breadth-first search (BFS) and depth-first search (DFS) on the following graph. Start at vertex a and handle neighbours in alphabetical order. Q1.1 BFS sequence 6 Points Provide the ordering of the vertices as they are visited by a BFS. Your answer should be a string consisting of the letters a-j without separators. For instance, if you think that the vertices are visited in the order j,i,h,g,f,e,d,c,b,a, then your answer should be jihgfedcba