$1)$ Create a class ArraySortedBag as a subclass of the class ArrayBag and define methods: constructor,

$\_\_$add$\_\_,$ find, add, remove, $\_\_$contain$\_\_,$ and merge.

$2)$ Create a class LinkedSortedBag as a subclass of the class LinkedBag and define methods:

constructor, $\_\_$add$\_\_,$ find, add, remove, $\_\_$contain$\_\_,$ and merge.

$3)$ Provide a tester function to thoroughly test these two classes $($create instances and call all the

methods of these $2$ classes$)$

$"""$

File: arraybag.py

$"""$

from arrays import Array

class ArrayBag$($object$)$:

$"""$An array$-$based bag implementation."""

# Class variable

DEFAULT$\_$CAPACITY $=10$

# Constructor

def $\_\_$init$\_\_($self$,$ sourceCollection $=$ None$)$:

$"""$Sets the initial state of self, which includes the

contents of sourceCollection, if it's present."""

self.items $=$ Array$($ArrayBag$.$DEFAULT$\_$CAPACITY$)$

self.size $=0$

if sourceCollection:

for item in sourceCollection:

self.add$($item$)$

# Accessor methods

def isEmpty$($self$)$:

$"""$Returns True if len$($self$)==0,$ or False otherwise."""

return len$($self$)==0$

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

$"""$Returns the number of items in self."""

return self.size

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

$"""$Returns the string representation of self."""

return $"\{"+",".$join$($map$($str$,$ self$))+"\}"$

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

$"""$Supports iteration over a view of self."""

cursor $=0$

while cursor $<$ len$($self$)$:

yield self.items$[$cursor$]$

cursor $+=1$

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

$"""$Returns a new bag containing the contents

of self and other."""

result $=$ ArrayBag$($self$)$

for item in other:

result.add$($item$)$

return result

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

$"""$Returns True if self equals other,

or False otherwise."""

# Exercise

return True

# Mutator methods

def clear$($self$)$:

$"""$Makes self become empty."""

# Exercise

pass

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

$"""$Adds item to self."""

# Check array memory here and increase it if necessary

# Exercise

self.items$[$len$($self$)]=$ item

self.size $+=1$

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

$"""$Precondition: item is in self.

Raises: KeyError if

File: arrays.py

An Array is a restricted list whose clients can use

only $[],$ len, iter, and str$.$

$"""$

class Array$($object$)$:

$"""$Represents an array."""

def $\_\_$init$\_\_($self$,$ capacity, fillValue $=$ None$)$:

$"""$Capacity is the static size of the array.

fillValue is placed at each position."""

self.$\_$items $=$ list$()$

for count in range$($capacity$)$:

self.$\_$items.append$($fillValue$)$

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

$"""->$ The capacity of the array."""

return len$($self$.\_$items$)$

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

$"""->$ The string representation of the array."""

return str$($self$.\_$items$)$

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

$"""$Supports iteration over a view of an array."""

return iter$($self$.\_$items$)$

def $\_\_$getitem$\_\_($self$,$ index$)$:

$"""$Subscript operator for access at index."""

return self.$\_$items$[$index$]$

def $\_\_$setitem$\_\_($self$,$ index, newItem$)$:

$"""$Subscript operator for replacement at index."""

self.$\_$items$[$index$]=$ newItem

$"""$

File: node.py

$"""$

class Node$($object$)$:

$"""$Represents a singly linked node."""

def $\_\_$init$\_\_($self$,$ data, next $=$ None$)$:

self.data $=$ data

self.next $=$ next

$"""$

File: baginterface.py

Author: Ken Lambert

$"""$

class BagInterface$($object$)$:

$"""$Interface for all bag types."""

# Constructor

def $\_\_$init$\_\_($self$,$ sourceCollection $=$ None$)$:

$"""$Sets the initial state of self, which includes the

contents of sourceCollection, if it's present."""

pass

# Accessor methods

def isEmpty$($self$)$:

$"""$Returns True if len$($self$)==0,$ or False otherwise."""

return True

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

$"""-$Returns the number of items in self."""

return $0$

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

$"""$Returns the string representation of self."""

return $""$

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

$"""$Supports iteration over a view of self."""

return None

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

$"""$Returns a new bag containing the contents

of self and other."""

return None

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

$"""$Returns True if self equals other,

or False otherwise."""

return False

# Mutator methods

def clear$($self$)$:

$"""$Makes self become empty."""

pass

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

$"""$Adds item to self."""

pass

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

$"""$Precondition: item is in self.

Raises: KeyError if item in not in self.

Postcondition: item is removed from self."""

pass

$""$PLEASE WRITE ONE Python code that fulfills the all requirements in the questions and provide the output""