Only need 4.6, but please explain or show some work as to how magnitudes were calculated. 4.4 and 4.5 are shown to do the problem but I DO NOT need the procedures written

4.4 Write MAKENULL, UNION, INTERSECTION, MEMBER, MIN, INSERT, and DELETE procedures for sets represented by lists using the abstract operations for the sorted list ADT. Note that Fig. 4.5 is a procedure for INTERSECTION using a specific implementation of the list ADT. 4.5 Repeat Exercise 4.4 for the following set implementations: a) open hash table (use abstract list operations within buckets). b) closed hash table with linear resolution of collisions. c) unsorted list (use abstract list operations). d) fixed length array and pointer to the last position used. 4.6 For each of the operations and each of the implementations in Exer- cises 4.4 and 4.5, give the order of magnitude for the running time of the operations on sets of size n. sing the