I need help with this assignment. It's data structures using Java. I just need to find the methods in Vector and ArrayList that most closely match our own List methods from the Java API.

The Java API contains two important structures for managing array-based lists. One, the Vector, manages lists in a thread-safe manner (for concurrency) and the other, the newer ArrayList, does the same but without the overhead required for multiprocessing thread-safety. How do these implementations compare with our own? Look at the online Java API documentation for both and post the following five details, for each of them, into a text file, attach it back to this assignment and send it in (you should have five methods listed for the Vector and another five listed for the ArrayList in a tabular arrangement): Find the methods in Vector and ArrayList that most closely match our own List methods of:

Book's LinkedListClass Java's Vector Java's ArrayList ------------------------- ------------------------- ------------------------- 1. isEmpty 2. retrieveAt 3. seqSearch 4. removeAt 5. listSize 

Now be careful! Compare our methods not necessarily by their names, but by their function, parameters and return types.

Thanks in advance.