evaluating the set adt we can use complexity analysis to determine the efficiency of the set adt operations as implemented in section for conveniencethe relevant portions of that implementation are shown again in listing on the next page the evaluation is quite simple since the adt was implemented using the list and we just evaluated the methods for that structure table provides summary of the worst case time-complexities for those operations implemented earlier in the text operation worst case set( ( len(so( in (ns add(xo(ns issubsetof(to( = ( union(to( traversal (ntable time-complexities for the set adt implementation using an unsorted list simple operations evaluating the constructor and length operation is straightforward as they simply call the corresponding list operation the contains methodwhich determines if an element is contained in the setuses the in operator to perform linear search over the elements stored in the underlying list the search operationwhich requires (ntimewill be presented in the next section and we postpone its analysis until that time the add(method also requires (ntime in the worst case since it uses the in operator to determine if the element is unique and the append(method to add the unique item to the underlying listboth of which require linear time in the worst case operations of two sets the remaining methods of the set class involve the use of two setswhich we label and bwhere is the self set and is the argument passed to the given method to simplify the analysiswe assume each set contains elements more complete analysis would involve the use of two variablesone for the size of each set but the analysis of this more specific case is sufficient for our purposes the issubsetof(method determines if is subset of it iterates over the elements of set aduring which the in operator is used to determine if the