Can someone show me diagrams/trees of how to go from Arad to Bucharest using Uniform cost search, depth first search, breadth first search and A*? Please provide pictures of the trees.