Please help me to finish this code in python "write a"Please help me to finish this code in pythonThe class declarations have been created in the a1_partb.py starter file. You are responsible to write all the listedfunctions.You are allowed to add data members to both Node and SetList.NodeThe Node class is declared within SetList. It stores:• a piece of data• a reference to the next Node in the SetList (None if Node is last node)• a reference to the previous Node in the SetList (None if Node is first node)• a reference to the SetList.When a Node is initialized, it is passed a data value and a reference to the Setlist the Node belongs to. Optionally it isalso passed a reference to the next node and a reference to the previous node (in that order). If the data values arenot passed in, they are defaulted to None.The Node function has the following member functions:def get_data(self)function returns data stored in nodedef get_next(self)function returns reference to next node in SetListdef get_previous(self)function returns reference to previous node in SetListdef get_set(self)function returns reference to the SetListfrontback444datanextprevsetcatdatanextprevsetfish·4datanextprevsetdog A SetList is a doubly linked list that can be used to represent a single set of a disjoint set. With a SetList, each nodecontains data and is linked to other nodes in the list. The difference with a regular doubly linked list is that each nodealso contains a link to the SetList object. The first node within the SetList contains the set's representative.The following is a diagram of the set: {"cat", "fish", "dog"}. Note that values within a set do not have any particularordering and the exact ordering does not matter in your implementation. This means that any of the 3 can be therepresentative..its simply a matter of which one is at the front of the listWhen a SetList is initialized, the SetList is empty.The SetList has the following member functionsdef get_front(self)This function returns a reference to the first node in the listdef get_back(self)This function returns a reference to the last node in the listdef make_set(self, data)This function adds the first value to the SetList object if the list is empty and returns a reference to newly createdNode. If the list is not empty, function does nothing and returns None.def union_set(self, other_set)This function is passed a SetList and performs a union with the current object. This means that the elements ofother_set are transfered to current object and other set becomes empty in the process. Function returns number ofelements transferred. Note, this process does not create or destroy any of the nodes.def find_data(self, data)This function is passed a data value, the function returns the a reference to the Node containing data. If data does notexist, function returns Nonedef representative_node(self)This function returns a reference to the node that holds the representative of the SetList. If SetList is empty, functionreturns Nonedef representative(self)This function returns the data of the representative node of the SetList. If SetList is empty, function returns Nonedef_len_(self)This function returns the number of items within the SetList.class Setlist:class Node:def __init__(self,data,set_list, next_node, prev_node):def get_data(self):def get_next(self):def get_previous(self):def get_set(self):def __init__(self):def get_front (self):def get back(self):def make_set(self, data):def find_data(self, data):def representative_node (self):

Linked list in Python which refers to the one it is Linked Lists are a data structure that store…

This function returns the number of items within the SetList. class Setlist: class Node: def __init__(self,data,set_list,next_node, prev_node): def get_data(self): def get_next (self): def get_previous (self): def get_set(self): def __init__(self): def get_front (self): def get back(self): def make_set(self, data): def find_data(self, data): def representative node(self):