Question 1 (1 point) In GPS Navigation Systems the_first traversal algorithm is used to find neighboring locations Save Question 2 (1 point) Traversal of a graph is different than a tree because 1) There can be a loop in a graph so we must aminatin a visited flag for every vertex 2) DFS of a graph uses a stack, but inorder traversal of a tree is recursive 3) BFS of a graph uses a queue, but a time efficient BFS of a tree is recursive 4) All of the above Save Question 3 (1 point) The first search is a good algorithm for detecting cycles in a graph. Save Question 4 (1 point) Topological Sorting for a graph is not possible if the graph is not a Directed Graph. Save