use python code to solve the tasks

Linked List: Using the Linked List ADT solve the following tasks. elasn Linkediattf def init (self)in Wef thatprintineltil prineyal - melt. headval. while pristval in not Noens pinile printvali print (prineval. dxtaval, end- ". '?) printval - pribtval, sextyal def stneginingr self, nowdots } theviode = Node ( nevidata ) - Update the nev noden next val to-existing nede glevilode.nextral = self -headval nelf.headval - Nevelode. Lef Atrndiself, eevdata)s - Mevelode - Mode(nevdata) fit tee list is Tapty if self, headval is None: self, headval = pemblode return He lits not eppoty lante in nelf headvel Whilin(tante: nextyal) f Iaste - lasto. nextichl Iaste, bext vari-tecidiode, Sof Inbetween (sedf, nidale inode, neviate ff 1f. middle poso in Noce.: print rt the neat robed node is absent?" zeturn Nevilode a Kodel (beridata) Hewripde, nextval - middie_eode .nextral midale_node, nextral = Hevitode CT 1451 Advance Applications Development 1ot semester 2022 (3) def find (self, key) t Get is Empty(seif): def get count (gelf): def str (self): CT 1451 Advance Applications Development 1+1 Semester 2022 python (3) Fxcrcue 1 - Complete the missing function in Linked List: Data Inbetween to do sume an function Inberween trut inclid of akizg a node ar an atgument take the data value Oata beler node w retum the data value for previous nod of a given one Nind0: Find an inem within the litited liat got counter lecturn the number of farms is the linked last Fxerrite 2: create a stack and Queue using the finked list ADT, does it necd any changes? Exercise 3 : create a linked list of 3 nodes and display it in reverse order [a,b,c], in 2 ways add in the code and using ADT Fecrise 4 : Using linked list ADT do the following [6.points] E Frutes lakna lia poilad L. Fill w with 5 munberie enter by the user Aik thit aarr fo eder a key wo wesch fir If the kevia in the lotgais frend If mid tiesol it at fint elocert