------------------------------ Please Use PYTHON -----------------------------------

Please DONT POST ANYTHING if you can't do it FULLY and if you are not SURE FROM YOUR WORKbecause I do not want to post same question again and again for to get full answer !!!

Note Bag Adt Code is given at the end of the question

class Bag :

def __init__( self ): self._items = list()

def __len__( self ): return len( self._items )

def __contains__( self, item ): return item in self._items

def add( self, item ): self._items.append( item )

def remove( self, item ): assert item in self._items, ndx = self._items.index( item ) return self._items.pop( ndx )

def __iter__( self ): return _BagIterator( self._items )

Implement the Bag ADT from Chapter 1 to use a sorted list and the binary search a. algorithm. Evaluate the time complexities for each of the operations b. Given the following list of keys (80, 7, 24, 16, 43, 91, 35, 2, 19, 72), show the contents of the array after each iteration of the outer loop for the indicated algorithm when sorting in ascending order. (a) bubble sort (b) selection sort (c) insertion sort c. Given the following list of keys (3, 18, 29, 32, 39, 44, 67, 75), show the contents of the array after each iteration of the outer loop for the (a) bubble sort (b) selection sort (c) insertion sort d. Implement the following functions related to the singly linked list: (a) The removeAll (head) function, which accepts a head reference to a singly linked list, unlinks and remove every node individually from the list. (b) The splitinHalf(head) function which accepts a head reference to a singly linked list, splits the list in half and returns the head reference to the head node of the second half of the list. If the original list contains a single node, none should be returned