(Solved) : Following Give Graph Tree Contains 15 Nodes One Arc Node Two Arcs Node C Graph Search Expa Q34474035 . . . .

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

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

(d) A graph where depth-first search and breadth-first searchboth expand fewer nodes than A* search. You must draw the graph andshow the order of the neighbors (this is needed for the depth-firstsearch).

Either give the arc costs and heuristic function or stateexplicitly that you are drawing the graph to scale and are usingEuclidean distance for the