<prompt> Theha laeborari ea khoutu e sebelisang sebopeho sa data se hokahaneng.nan  <response>: Instruction in English: Create a library of code that implements a linked list data structure. . Response in English: Here is an implementation of a linked list data structure that you could use:pythonclass Node: def __init__self, data: self.data data self.next Noneclass LinkedList: def __init__self: self.head None def insertself, data: new_node Nodedata if self.head is None: self.head new_node return last self.head while last.next: last last.next last.next new_node def removeself, key: head_val self.head if head_val is not None: if head_val.data key: self.head head_val.next head_val None return while head_val is not None: if head_val.data key: break prev head_val head_val head_val.next if head_val is None: return prev.next head_val.next head_val None def searchself, key: current self.head while current is not None: if current.data key: return True current current.next return False def displayself: val self.head while val is not None: printval.data, end val val.next printThis implementation of linked list includes the following methods:- insertdata: adds a new node with the specified data to the end of the list.- removekey: removes the first occurrence of the specified key from the list.- searchkey: returns True if the specified key is present in the list, otherwise returns False.- display: prints the elements of the linked list. . Response in Sesotho: Mona ke tsebetsong ea lenane le hokahantsoeng la sebopeho sa data seo u ka se sebelisang: python class Node: def __init__self, data: self.data data self.next None class LinkedList: def __init__self: self .hlooho Ha ho na def kenyaboithati, data: new_node Nodedata if self.head is None: self.head new_node return last self.head while last.next: last last.next last.next new_node def tlosaboithati, senotlolo: head_val self.head if head_val is not None: if head_val.data key: self.head head_val.next head_val Ha ho khutle ha head_val e se Ha ho letho: haeba head_val.data key: break prev head_val head_val head_val.next if head_val is None: return prev.next head_val.next head_val None def searchself, key: current self.head while current ha e eo: ha e le hona jwale. data key: return True current current.next return False def displayself: val self.head ha val e se Ha ho letho: hatisaval.data, end val val.next print Tsebetsong ena ea lenane le hokahaneng e kenyelletsa mekhoa e latelang: - kenyadata: e eketsa node e ncha e nang le lintlha tse boletsoeng qetellong ea lenane. - tlosasenotlolo: e tlosa ho hlaha ha konopo e boletsoeng lethathamong. - batlasenotlolo: e khutlisa Nete haeba senotlolo se boletsoeng se le teng lethathamong, ho seng joalo e khutlisa Mahata. - bontša : e hatisa likarolo tsa lenane le hokahaneng. 