Running time of LinkedList and Sorted ArrayList functions.

Questions (refers to both Linked list without a tail and Sorted Array List, so you need to have 4 answers.

1) Reversing the list (content of each node).

Linked List:

Sorted Array:

2) Removing a value at a given index.

Linked List:

Sorted Array:

Please give your answer like the answers below.

Example Question: Adding a value to the beginning of the linked list. Example Answer: Running time: (1). You have a pointer to the head node in the list, so adding an element involves creating a new node (which is not dependent on the length of the list), setting the links in the new node, and changing the values of the head references. This takes somewhere around 10 steps to perform, and 10=(1).

Example Question: Adding a value to the beginning of the array list. Example Answer: Running time: (n). You have to move everything over one cell to create a room for a new element. It will be done using a for loop that iterates through all elements. Since there are n elements in the list, it takes (n) to add a new element to the beginning of the array list.