2 Graph Search vs Tree Search (10 pts) In class we discussed the graph-based forms of breadth first search, depth first search, and A search. Read about the tree-based forms of these algorithms and their properties. Write a paragraph about the differences between tree and graph based search methods. You should at least answer the following questions: 1. When would you expect the graph-based algorithms to perform better than the tree-based ones? 2. When would you expect the tree-based algorithms to perform better than the graph-based ones? 3. Give examples of problems that would be better formulated as tree search problems, and problems that would be better formulated as graph search problems. Justify these examples (why are these problems better formulated each way?)