In Graph Mining course, we always deals with the large graphs, and they are always complex and dense. The main operation, which we execute on it$,$ are the reachability queries. Now consider that, the graph, on which we are working with, is XML data, which is$,$ in the form of$,$ tree structure. So among the Breadth first search or Depth first search, which will be the better and faster traversal while answering the reachability queries? $($you should give all the required details and explanations, to justify your view$)$

$[4$ Marks