Write a specialized singly linked list class in Python$3.$ Our specialized list will have several unique properties:

$1.$ Our linked list stores only integers.

$2.$ Elements in the linked list are kept in ascending order. This means the root stores the smallest element in the

list. The final element in the list is the largest.

$3.$ It does not store duplicates. This means that attempting to insert an element that is already present will

result in no change to the list.

$4.$ All tree operations must be implemented using iteration $($not recursion$)$

OrderedLinkedListNode Class Requirements

This class is used by the list class below to store data and the next node.

class OrderedLinkedListNode:

The class must be called OrderedLinkedListNode.

def $\_\_$init$\_\_($self$,$ data$)$:

$$ The data parameter contains the integer data this node will store.

$$ Should initialize a next$\_$node variable to None. This member variable will store a reference to the next node

in the linked list.

def get$\_$data$($self$)$:

$$ Returns the contents of data member variable.

def get$\_$next$\_$node$($self$)$:

$$ Return the contents of the next$\_$node member variable.

def set$\_$next$\_$node$($self$,$ next$\_$node$)$:

$$ Sets the next$\_$node member variable to the next$\_$node argument.

OrderedLinkedList Class Requirements

Pay close attention to section. Your class name and functions must conform exactly to the specifications given below.

When grading I will be using test code that expects the class and its member functions to have a specific format.

class OrderedLinkedList:

The class must be called OrderedLinkedList. It should utilize the OrderedLinkedListNode class above

def $\_\_$init$\_\_($self$)$:

$$ Sets up all necessary variables.

$$ The init function should build an empty list.

def get$\_$root$($self$)$:

$$ Returns the root node of the list, or None if the list is empty.

def insert$($self$,$ data$)$:

$$ Finds the location in the list where the value in data should be inserted.

$$ If data is not in the list, it is inserted. After insertion, the list maintains its ascending sorted property.

$$ If data is in the list, there is no change to the list.

$$ If data was inserted into the list, insert returns True. If a duplicate was found, it should return False.

def remove$($self$,$ data$)$:

$$ Finds the location in the list where the value in data should be$.$

$$ If data is in the list, it is removed. After removal, the list maintains its ascending sorted property.

$$ If data is not in the list, there is no change to the list.

$$ If data was removed from the list, remove returns True. If data was not in the list, the function returns False.

def contains$($self$,$ data$)$:

$$ Returns True or False depending on if data is in the list.

def print$\_$list$($self$)$:

$$ Prints the list on a single line with a terminating newline. For example: $169111820$

def merge$\_$list$($self$,$ other$)$:

$$ Merges the OrderedLinkedList, other, with this one. The resulting list should contain all the elements of this

list and the other list.

$$ other should be unchanged.

$$ Returns None