a) Why do we use asymptotic analysis over experimental analysis? What case do we most often consider, why dont we typically consider the others? Answer in 2-3 sentences for each question..

b) What are the two types of Big-O performance we went over in lecture? What do they mean? Answer in 2-3 sentences.

c) What is the Big-O performance of the following operations?

i) Searching through a Singly Linked List for an arbitrary value.

ii ) Searching through a fixed array for an arbitrary value.

iii) Getting the element of the i-th position in a Singly Linked List.

iv) Getting the element of the i-th position in a fixed array.

v) Getting the last element of a Doubly Linked List.