2. Implement Blinky Ghost agent chasing after Pacman using UCS The idea of this task is to add intelligence to a ghost. This is done my implementing a ghost agent that tells what action ghost should take in the current moment to get closer to pacman. • Override the inherited implementation of getNext Move in the class BlinkyGhost Agent (file GhostAgent.java). • Hint: you will need to solve a search problem and extract the action to be returned from the solution. You can reuse a suitable existing search problem or implement a new one. • Hint: use the method GraphSearch.search() with appropriate parameters. In particular, you will need to initialise a problem object. You can test your implementation by simply running PacmanMain and checking that one of the ghosts chases after pacman. java -cp./out PacmanMain Try not using the keyboard so that pacman is not moving. Try to move pacman and check that the ghost is following pacman.

Let's get some more practice with algorithms by escaping from a maze! Implement a public class Maze Escape that provides a single public class method named escape. escape accepts a single parameter, a Maze object with methods explained below. Your goal is to manipulate the maze until you reach the exit, and then return it when you are finished. If the passed maze is null, throw an IllegalArgumentException. To navigate the maze, using the following Maze methods: • isFinished (): returns true when you have reached the exit of the maze • turnRight () rotates your character 90 degrees to the right • turnLeft() rotates your character 90 degrees to the left • canMove () returns true if you can move one cell forward, false otherwise. Your path may be blocked by a wall! • move () moves your character one cell forward and increases the step counter The passed Maze object represents a simply-connected or perfect maze: one that contains no loops. As a result, we suggest that you pursue a classic…

Write a Graph class in Java. This class should represent undirected graphs. You can choose one of the representationsfrom our graph exercises, eg object model, sets of nodes and edges, adjacency matrix, or soon, whichever you feel most comfortable with.● Include comments in your Java file to explain how nodes and edges are represented.● Assume that only one edge can exist between two nodes.● Assume that it is possible to have an edge connecting a node to itself, ie that a nodecan be connected to itself via an edge.● Because edges are undirected, an edge between v and w is also one between w and v.● Your constructor method should take one parameter: the number of nodes of thegraph.  Add a method to your class: boolean addEdge that takes two parameters, v andw (representing two modes v and w which are connected together by the edgebeing added). If successful, the method should return true. The method should return false when it isunsuccessful, which is in the following cases: the edge is…

Implement the Solver class. In doing so, you are allowed to define other classes to help you (as well as use “built-in” Java classes or the book’s classes). The point of the solver class is the solve method which takes a board/puzzle configuration represented as a 2D array of booleans and returns a char array containing a minimal sequence of moves that will lead to the solved board (all the cells around the edges being filled). The board configuration is passed in as a 5-by-5 boolean array of Booleans with exactly 16 true cells (filled) and 9 false cells (empty). The solve method then returns an array of characters representing a minimal sequence of moves that solves the puzzle. In other words, if the characters from the returned array are used in order as input to the move method on the Board object representing the initial configuration, the resulting board configuration represents the solved board. Furthermore, the solution must be minimal in the sense that there are no solutions…