. Give the ratio of the average speed of an Unsorted-Optimized array structure to the average speed of a Singly Linked List structure, assuming each structure contains one million information nodes and all operations are equally probable. Note: See Table 4.1 in the text for the average speed equations.

Unsoreted

insert delete feach delete +insert average Big(O) avergae for n=10^7 Condtion for Density > 0.8

3 < n < n < n+3 <3n+6/4 O(n) < 0.75* 10^7 +1..5 w > 16