Given a graph, implement Prims algorithm via Python 3. The input of the Graph class is an AdjacencyMatrix. Complete the Prim function. The Prim fucntion should return the weight sum of the minimumspanning tree starting from node 0.The filegraph.pyis provided; use this file to construct your solution and upload with the samename. You may add class variables and methods butDO NOT MODIFY THE PROVIDEDFUNCTION OR CLASS PROTOTYPES..Here is an example of how your code will be called:

Sample input:

g = Graph([ [0, 10, 11, 33, 60],

[10, 0, 22, 14, 57],

[11, 22, 0, 11, 17],

[33, 14, 11, 0, 9],

[60, 57, 17, 9, 0]])

assert g.Prim() == 41

class Graph(): def _init__(self, adjacency_matrix): Graph initialized with a weighted adjacency matrix Attributes adjacency_matrix : 2D array non-negative integers where adjacency_matrix[i][j] is the weight of the edge i to j, with 0 representing no edge self.adjacency_matrix = adjacency_matrix # Add more class variables below as needed, such as n: # self. N = len(adjacency_matrix) def Prim(self): Use Prim-Jarnik's algorithm to find the length of the minimum spanning tree starting from node 0 Returns int Weighted length of tree return -1 # Example use case: # G = Graph ( [[0, 10, 11, 33, 60), # [10, 0, 22, 14, 57], # [11, 22, 0, 11, 17], # [33, 14, 11, 0, 9), # [60, 57, 17, 9, 0]]). # assert G.Prim() == 41