For the remaining problems, use each search strategy to find the goal (node G; start from node S). You CANNOT just state the answer. For each problem below, a chart which represents what nodes/paths are on the FRINGE at each iteration/step of the search algorithm can be found. For each iteration in problems 3-6, indicate each path and its corresponding cost, as indicated in the graph. Once you have expanded and written all the nodes/paths on the fringe for an iteration, draw a box around the node/path that will be removed from the fringe at the next iteration. Any time you encounter a goal state, circle it (even if it remains on the fringe, circle it each iteration). HINT1: You will know you are done when you have a node that is both circled and boxed. HINT2: Don't try to read my mind on the number of rows or columns given...you may not need them all. HINT3: I've filled out the first iteration for you. Since the path "S" is the only node on the fringe to begin with, it is chosen to be removed (hence the box) and will not appear in iteration 2. If you want to represent the next node A, which comes from S, write it as "SA" in the path field below. If you want to represent the node B, which came through A and S, write it as "SAB" in the path field below, etc. 5.) Uniform Cost Search (UCS). When expanding, expand from left to right (i.e., if a child has two nodes, add the one on the left to the fringe first). Although you will need to use a priority queue and set (to keep track of visited states), you do not need to draw them here for points/correctness, but you may want to draw them on scrap paper below to help. How many nodes were expanded (i.e., how many iterations did it take? What was the path computed by this search strategy? Was the computed path optimal