Question: Suppose that you want to splice part of one linked list into another (a socalled cut and paste operation). Assume that three Linked List Iterator parameters represent the starting point of the cut, the ending point of the cut, and the point at which the paste is to be attached. Assume that all iterators are valid and that the number of items cut is not zero.
a. Write a method to cut and paste that is not a part of weiss .nonstandard. What is the running time of the algorithm?
b. Write a method in the Linked List class to do the cut and paste. What is the running time of the algorithm?