write it out, do not solve with code.

nsider the Romania map. Initial State: Craiova ( C) Goal State: Bucharest (B) Actions = ckwise from Northerly). Each strategy (\#2.a -2.c below) should explicitly include: - Search Tree constructed - algorithm is specific to strategy, with Initial State as root; - actions should be applied where available, per Actions order; - child nodes containing states are positioned left to right, according to the order of action applied - Data Structures tracked \& maintained for o frontier nodes (e.g., stack, queue, priority queue) - explored states (list) - according to strategy \& graph search (to avoid exploration/expansion of duplicate states) - Solution Path - explicitly noted. - Solution Cost - if no step cost is given, assume 1 unit per step. a. Apply Breadth-First Search strategy. b. Apply Depth-First Search strategy. c. Apply Uniform Cost Search strategy