Advanced level school Python programming. need helps.

Task 2.1 The class Node is implemented for you. Complete the class Linkedlist based on the description below. \begin{tabular}{|c|c|} \hline Class function & Description \\ \hline Linkedlist (compare_func) & \\ \hline insert (data) & \begin{tabular}{l} This recursive function inserts the new data, data, \\ into the linked list as a node. \\ Note: compare func must be used to determine \\ how the new data is inserted. If you do not know how \\ to use it, implement a normal sorted linked list that \end{tabular} \\ \hline \end{tabular} Save your program as Task2a.ipynb. Task 2.2 Define an appropriate compare_function such that the linked list will always insert the new item at the head of the linked list. Task 2.3 Define an appropriate compare_function such that the linked list will always insert the new item at the tail of the linked list