2. (a) An algorithm's performance may be measured experimentally or theoretically. (i) Describe in detail how theoretical algorithm analysis is performed. (ii) Describe in detail how you would perform an experimental comparison of two different algorithms for one task. (iii) What, in your opinion, are the advantages of each approach? (b) Explain what a linked list is, and list all of its main operations/functions. Using appropriate diagrams and/or code, demonstrate how all of the main operations should be performed. (c) Making reference to your answer in Part (b) above, perform theoretical complexity analysis from first principles of the following operations on a linked list: (i) Retrieve the nth element from a linked list (ii) Insert an element at an arbitrary position in a linked list. (d) Perform theoretical complexity analysis from first principles of the following operations on a standard array: (i) Retrieve the nth element from an array (iii) Insert an element at an arbitrary position in an array. [9] [6] + [41 (e) What can you conclude from your analysis of Parts (c) and (d) above?