For each of the following, give a graph that is a tree contains at most 15 nodes, has at most one arc into any node, and at most two arcs out of any node.

(c) A graph where A* search expands fewer nodes than either depth-first search or breadth-first search.

(d) A graph where depth-first search and breadth-first search both expand fewer nodes than A* search.

You must draw the graph and show the order of the neighbors (this is needed for the depth-first search). Either give the arc costs and heuristic function or state explicitly that you are drawing the graph to scale and are using Euclidean distance for the arc costs and the heuristic function. Explain why the graph you give is a solution to the problem.