Prove or show that the worst case time for the mul method

Question

1. Prove or show that the worst case time for the mul method of the Polynomial class implemented in this chapter is O(n² ).

2. We have provided two implementations of the Set ADT in Chapter 1 and Chapter 4.

(a) Implement a new version of the Set ADT using an unsorted linked list.

(b) Implement a new version of the Set ADT using a sorted linked list.

(c) Evaluate your new implementations to determine the worst case run time of each operation.

(d) Compare the run times of your new versions of the Set ADT to those from Chapter 1 and Chapter 4.