In JAVA Please!!

1. We can operationally define a fundamental operation to be either: a. copying a single piece of data from one location to another (as one would do with an array), or b. using a reference for traversing from one node to another (as one would do with a linked list). With the assumption that all of the structures mentioned below implement the List interface and contain 1000 characters, specify the number of fundamental operations you would need (rounded to the nearest 100) for each of the following method calls as they have been presented in class (n.b., 1 rounded to the nearest 100 is 0). DO NOT GIVE BIG-O NOTATION. a. Calling add(800, 'x') on a Singly-Linked List b. Calling remove(700) on a Doubly-Linked List C. Calling get(100) on an ArrayStack d. Calling add(200, 'x') on an ArrayDeque e. Calling add(400, 'x') on an DualArrayDeque where front.size() = 300 and back.size() = 700 1. We can operationally define a fundamental operation to be either: a. copying a single piece of data from one location to another (as one would do with an array), or b. using a reference for traversing from one node to another (as one would do with a linked list). With the assumption that all of the structures mentioned below implement the List interface and contain 1000 characters, specify the number of fundamental operations you would need (rounded to the nearest 100) for each of the following method calls as they have been presented in class (n.b., 1 rounded to the nearest 100 is 0). DO NOT GIVE BIG-O NOTATION. a. Calling add(800, 'x') on a Singly-Linked List b. Calling remove(700) on a Doubly-Linked List C. Calling get(100) on an ArrayStack d. Calling add(200, 'x') on an ArrayDeque e. Calling add(400, 'x') on an DualArrayDeque where front.size() = 300 and back.size() = 700