A Topological Sorting Algorithm The basic algorithm for topological sorting is straightforward: 1. Locate a vertex with no successors. 2. Insert the vertex into the list of vertices. 3. Subtract the vertex from the graph. 4. Repetition Step 1 until all vertices have been deleted. Implement the algorithm by writing code.

Given a weighted graph class and a PQInt class, please complete the implementation of the Dijkstras algorithm according to the instructions in the screenshot provided. Be done in python 3.10 or later, please   class WeightedGraph(Graph) :    """Weighted graph represented with adjacency lists."""     def __init__(self, v=10, edges=[], weights=[]) :        """Initializes a weighted graph with a specified number of vertexes.         Keyword arguments:        v - number of vertexes        edges - any iterable of ordered pairs indicating the edges         weights - list of weights, same length as edges list        """        super().__init__(v)        for i, (u, v) in enumerate(edges):            self.add_edge(u, v, weights[i])                    def add_edge(self, a, b, w=1) :        """Adds an edge to the graph.         Keyword arguments:        a - first end point        b - second end point        """        self._adj[a].add(b, w)        self._adj[b].add(a, w)     def…

agents: An agent is trying to eat all the food in a maze that contains obstacles, but he now has the help of his friends! An agent  cannot occupy  a  square that has an obstacle. There are initially k pieces of food (represented by dots), at positions (f1,...,fk). There are also n agents at positions (p1,...,pn). Initially, all agents start at random locations in the maze. Consider a search problem in which all agents move simultaneously ;that is, in each step each agent moves into some adjacent position (N, S, E, or W, or STOP). Note that any number of agents may occupy the same position.           Figure 1: A maze with 3 agents For each of the following heuristics, indicate (yes/no) whether or not it is h1: The number of dots (representing food) remaining. [ True, False ]. h2(s)=0, where s is a state node. [ True, False ]. h3(s)=1, where s is a state node. [ True, False ].

Java-.Selection and insertion sort  3.a    Show steps of selection sort for the given array. You may need to add more rows to the table.   Selection Sort Initial value 3 2 7 5 4 8 9 10 1 Search 0 . . . end 3 2 7 5 4 8 9 10 1 Swap index 0                   Search 1 . . . end                   . . .                                                                                                                                                               3.b    Show steps of insertion sort for the given array. You may need to add more rows to the table.   Insertion Sort Initial value 3 2 7 5 4 8 9 10 1 , first item is sorted 3 2 7 5 4 8 9 10 1 , first 2 items are…