Consider an array and a linked list, both with n elements. Answer the following questions for both data structures. (a) Analyze the worst-case time complexity of the following operations. Explain your answer in detail. i. Accessing the first element. ii. Accessing the last element. iii. Accessing any element in the middle. iv. Adding a new element at the beginning. v. Adding a new element at the end. vi. Adding a new element in the middle. vii. Deleting the first element. viii. Deleting the last element. ix. Deleting any element in the middle. (b) Analyze the space requirements.