Please help me code the prim's algorithm to return the length of the minimum spanning tree of a graph in python. Please do not modify the provided function or class prototypes. The code contains a sample input to check the code.

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