3. You are given the following state space of a problem. In this diagram, each node represents a state, and each directed edge represents a transition action. For example, means there is an action from state A to state B and this action has a step cost of 20. Note that since there is no directed edge starting from state B to state A, there is no action available from transiting from state B to state A. The green state A is the initial state, and the red state G is the goal state. a. Please use breath-first search to (1) find a sequence of actions that can travel from state A to state G,(2) calculate the corresponding path cost, and (3) visualize the final search tree. ( 8 marks) b. Please use uniform-cost search to (1) find a sequence of actions that can travel from state A to state G, (2) calculate the corresponding path cost, and (3) visualize the final search tree. ( 8 marks)