Python and a graph Implement the heap-sort algorithm. Experimentally compare its running time with that of insertion sort and the built-in Python sorted function. You could use dummy functions with O(n^2) and O(nlogn) and use them as benchmarks in your graph. Results: 1. A graph showing the curves for heap-sort, insertion sort, and built-in the sorted function. 2. code that generates the data used in the graph.

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…

Please help with the program below. Need to write a program called dfs-stack.py in python that uses the algorithm below without an agency list but instead uses an adjacency matrix. The program should prompt the user for the number of vertices V, in the graph.Please read the directions below I will post a picture of the instructions and the algorithm.

this is for my data structure class please provide me with the complete code and the output thank you