1:52 Back Assignment 1.pdf 3. [3+3 31 Consider a planer map. Color the regions ith four difference color such that no two regions has the same color Formulate the problem as a state space search problem which means you must come up with following a) state b) successor function tal and goal states. 4[2+4+4+4]Consider the search space below, where S is the start node and G1 and G2 satisty the goal test. Ares are labeled with the cost of traversing them and the estimated cost to a goal is reported inside nodes (so lower scores are better. a) Would it be a good idea to use the Depth-First Search in this example or not? Why? Write the contents of the frontier, putting the path that will be selected as the first element, for four iterations using b) lowest-cost first c) best-first d) A Calendar To Do Inbox