Traversal of a graph is different from tree becausea)All of the mentionedb)BFS of a graph uses queue, but a time efficient BFS of a tree is recursivec)There can be a loop in graph so we must maintain a visited flag for every vertexd)DFS of a graph uses stack, but inorder traversal of a tree is recursive

Traversal of a graph is different from a tree due to several reasons:

a) All of the mentioned: This option suggests that all the following statements are reasons why graph traversal is different from tree traversal.

b) BFS of a graph uses queue, but a time efficient BFS of a tree is recursive: Breadth-First Search (BFS) of a graph uses a queue data structure to keep track of vertices to visit next. In contrast, a time-efficient BFS of a tree is typically implemented recursively, without the need for a queue.

c) There can be a loop in graph so we must maintain a visited flag for every vertex: Unlike trees, graphs can contain cycles or loops. This means that a traversal algorithm could potentially visit the same vertex multiple times, leading to an infinite loop. To prevent this, a 'visited' flag is typically maintained for each vertex in the graph.

d) DFS of a graph uses stack, but inorder traversal of a tree is recursive: Depth-First Search (DFS) of a graph uses a stack data structure to keep track of vertices to visit next. In contrast, an inorder traversal of a tree is typically implemented recursively, without the need for a stack.

So, the answer is (a) All of the mentioned, because all the statements (b, c, d) are correct and are reasons why graph traversal is different from tree traversal.