determine the worst case time complexity for each method of the map adt implemented in section modify the binary search algorithm to find the position of the first occurrence of value that can occur multiple times in the ordered list verify your algorithm is still (log design and implement function to find all negative values within given list your function should return new list containing the negative values when does the worst case occur and what is the run time for that case in this we used modified version of the mergesortedlists(function to develop linear time union(operation for our set adt implemented using sorted list use similar approach to implement new linear time versions of the issubsetof()intersect()and difference(methods given the following list of keys ( )show the contents of the array after each iteration of the outer loop for the indicated algorithm when sorting in ascending order (abubble sort (bselection sort (cinsertion sort given the following list of keys ( )show the contents of the array after each iteration of the outer loop for the (abubble sort (bselection sort (cinsertion sort evaluate the insertion sort algorithm to determine the best case and the worst case time complexities programming projects implement the bag adt from to use sorted list and the binary search algorithm evaluate the time complexities for each of the operations implement new version of the map adt from section to use sorted list and the binary search algorithm the implementation of the sparse matrix adt from can be improved by storing the matrixelement objects in sorted list and using the binary search to locate specific element the matrix elements can be sorted based on the row and column indices using an index function similar to that used with - array stored in multiarray implement new version of the sparse matrix adt using sorted list and the binary search to locate elements implement new version of the sparse life grid adt from to use sorted list and the binary search to locate the occupied cells