Hello would I be able to get some help with the add method for this program?

class SortedLinkedList We will implement a class called SortedLinkedList that uses the provided class Node to store its elements in sorted order. Note that you are not allowed to use any other data structures, e.g., SLList, DLList, or python's list, as a storage for the elements. You must use Node directly to store the elements. For the purpose of testing and debugging, you should implement the methods of SortedlinkedList in the order described below. Note that SortedLinkedList permits the insertion of duplicate elements. 1. isEmpty (self) takes no argument and returns True if the list is empty. Otherwise, it returns FALSE. 2. len_(se1f) takes no argument and returns the number of elements in the list. 3. add (self, value) takes one argument, value, which is either an integer or a float and inserts value to the list in sorted order. After the insertion, it returns itself so that the method calls can be concatenated. For example, given an instance x of SortedLinkedList, if x.add (5) returns x back, then we can concatenated the method calls as follows: x, add(5),add(10), add (15) 4. remove(self, value) takes one argument, value, which is either an integer or a float and removes value from the list. After the removal, it returns itself so that the method calls can be concatenated. 5. duplicate (self) takes no argument and returns a new instance of SortedLinkedList where each element of the original list is duplieated as many times as the element's value. For example, if the original list contains 24, then the new list must contain 224444. The number of duplication of each elements depends on the element's value as follows