You will implement a custom MultiSet class using a sorted singly linked list as the storage mechanism. A MultiSet is a collection of elements that allows duplicates and keeps track of the count of each element.

Initial Code Segment:

You will be using the following skeleton code in your assignment. Class and method names, and initial comments are given for you.

class Node:

def $\_\_$init$\_\_($self$,$ value, count$=1)$:

$"""$Initialize a node with a value and a count."""

self.value $=$ value

self.count $=$ count

self.next $=$ None

class MultiSetClass:

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

$"""$Initialize an empty multiset using a linked list."""

self.head $=$ None

def add$($self$,$ element$)$:

$"""$Add an element to the multiset."""

pass

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

$"""$Remove one occurrence of the specified element from the

multiset."""

passdef count$($self$,$ element$)$:

$"""$Return the count of occurrences of the specified

element."""

pass

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

$"""$Return the total number of elements in the multiset

$($including duplicates$)."""$

pass

def $\_\_$contains$\_\_($self$,$ element$)$:

$"""$Check if an element exists in the multiset."""

pass

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

pass

$"""$Return a string representation of the multiset."""

def union$($self$,$ other$)$:

$"""$Return a new MultiSet that is the union of this and

another MultiSet."""

pass

def intersection$($self$,$ other$)$:

$"""$Return a new MultiSet that is the intersection of this

and another MultiSet."""

pass

def $\_\_$add$\_\_($self$,$ other$)$:

$"""$Overload the $+$ operator to combine two multisets."""

pass

def $\_\_$sub$\_\_($self$,$ other$)$:$"""$Overload the $-$ operator to subtract one multiset from

another."""

pass