Consider the graph above, starting from node $A$ :

a$)$ what is the finish order of the dept first search? $($if two nodes can be reached from a node, give preference to one which is smaller$).$

b$)$ what is the visit sequence of the Breadth first search. $($if two nodes can be reached from a node give preference to one which is alphabetically smaller$).$

Computer Science $-$ Data Structures