Question-2: Analysis and programming Write a program to test the performance of java.util.ArrayList vs java.util.LinkedList ArrayList: (4 Marks) ArrayList is implemented as a resizable array. As more elements are added to ArrayList, its size is increased dynamically. lt's elements can be accessed directly by using the get and set methods, since ArrayList is essentially an array. LinkedListl LinkedList is implemented as a doubly-linked list. Its performance on add and remove is better than Arraylist, but worse on get and set methods. Performance of ArrayList vs. LinkedList The time complexity comparison is as follows: ArrayListLinkedList o(n) O(1) amortized o(n) get0 ddo) o) amortized removeOO(n) (Hint you can use System.nano Time0 to measure the time is taken to perform the operations)