## 1- Show each step of DFS traversal according to the algorithm on the given tree. [starting from the root node placement in external data structure] 1 2 7 8 3 6 9 12 4 5 10 11 2- What is the difference between BFS and DFS algorithms? How can the difference be implemented? 3- Run Dijkstra Algorithm on the given graph. 5 2 3 16 4 3 1 7 4 4 7 12 6 5 10

EXPERT ANSWER 1. DFS or Depth First Search follows depth wise travesal in which the next vertex is remebered using the stack. Rules for DFS are: 1. Unvisited adjacent vertex are visited and pushed in to the stack. 2. If there is no adjacent vertex found, it will popup from the stack and search till …