3. Uniform-Cost Search (35 points) (a) Perform uniform-cost search (UCS) by hand on the graph below. The start and goal nodes are labeled S and G, respectively. You must include the priority queue (showing when nodes are inserted/expanded), a cost-to-node table, and a list of backpointers. Clearly specify the final path. (b) Now, implement UCS for the same graph above in Python. Your file must be named ucs.py; it will be run from Git Bash using the following command: python ucs.py. Your code should display the final path as output. 3. Uniform-Cost Search (35 points) (a) Perform uniform-cost search (UCS) by hand on the graph below. The start and goal nodes are labeled S and G, respectively. You must include the priority queue (showing when nodes are inserted/expanded), a cost-to-node table, and a list of backpointers. Clearly specify the final path. (b) Now, implement UCS for the same graph above in Python. Your file must be named ucs.py; it will be run from Git Bash using the following command: python ucs.py. Your code should display the final path as output