Problem 3. Invert a Sequence. Consider a sequence S that provides the following methods: insertFirst(e) inserts element e into the first position of S and returns a locator to the newly inserted element remove(l) removes the element with locator l from S and returns it removes the elementwh locatorI from S and returns it. first0 returns a locator to the first element of S. last0 returns a locator to the last element of S. size) returns the number of elements of S. 1. Provide a new method invert0 that inverts the order of the elements 2. Can you perform invert) without using method last) given to you? Note that invert() does not return a new sequence but rearranges the in the sequence and accesses the sequence only through the above methods. elements of the current sequence. You can use temporary sequences for auxiliary storage in order to perform this operation