searching and sorting comparing the implementations the implementation of the set adt using an unsorted list was quick and easybut after evaluating the various operationsit became apparent many of them were time consuming new implementation using sorted list to store the elements of the set and the binary search algorithm for locating elements improved the contains method this resulted in better times for the issubsetof(and eq methodsbut the set unionintersectionand difference operations remained quadratic after observing several operations could be further improved if they were implemented to directly access the list instead of using the contains methodwe were able to provide more efficient implementation of the set adt table compares the worst case time-complexities for the set adt operations using an unsorted list and the improved sorted list version using the binary search and the list merging operation operation unordered improved set( ( ( len(so( ( in (no(log ns add(xo(no(ns issubsetof(to( (ns = ( (ns union(to( (ntable comparison of the two set adt implementations using an unsorted list and the improved sorted list with binary search and list merging exercises given an unsorted list of valueswhat is the time-complexity to find the smallest value in the worst casewhat would be the complexity if the list were sorted what is the (*for the findsortedposition(function in the worst case consider the new implementation of the set class using sorted list with the binary search (aprove or show the worst case time for the add(method is ( (bwhat is the best case time for the add(method