1. Design and implement a function to find all negative values within a given list. Your function should return a new list containing the negative values. When does the worst case occur and what is the run time for that case?
2. In this chapter, we used a modified version of the mergeSortedLists() function to develop a linear time union() operation for our Set ADT implemented using a sorted list. Use a similar approach to implement new linear time versions of the isSubsetOf(), intersect(), and difference() methods.