in the next sectionwe will see that the above five methods suffice for deriving all other behaviors of set those remaining behaviors can be naturally grouped as follows we begin by describing the following additional operations for removing one or more elements from sets remove( )remove element from the set if the set does not contain eraise keyerror pop)remove and return an arbitrary element from the set if the set is emptyraise keyerror clear)remove all elements from the set the next group of behaviors perform boolean comparisons between two sets =treturn true if sets and have identical contents !treturn true if sets and are not equivalent <treturn true if set is subset of set treturn true if set is proper subset of set >treturn true if set is superset of set treturn true if set is proper superset of set isdisjoint( )return true if sets and have no common elements finallythere exists variety of behaviors that either update an existing setor compute new set instancebased on classical set theory operations treturn new set representing the union of sets and |tupdate set to be the union of and set treturn new set representing the intersection of sets and &tupdate set to be the intersection of and set treturn new set representing the symmetric difference of sets and tthat isa set of elements that are in precisely one of or ^tupdate set to become the symmetric difference of itself and set treturn new set containing elements in but not -tupdate set to remove all common elements with set