2. Search for some x, if x is in the list return true otherwise false. There are three algorithms. Algorithm one uses linked-list, two uses queue, and three uses array as their data structures.

1. What is the worst-case time complexity of the algorithm using linked list? 2. What is the worst-case time complexity of the algorithm using queue? 3. What is the worst-case time complexity of the algorithm array?

Explain for each.