1.Compare linear search to binary search as algorithms for searching records in a Java program. Describe each one. When would you use each of them? What is the "bigO" complexity of each?(10points)

2. Compare the bubble sort and insertion sort algorithms for sorting records in a Java program? What are the disadvantages and advantages of each? When would you use each of them ? What is the "bigO" complexity of each (10points)

3. Compare a Queue to a stack as data structures in Java. When would you use each of them? (10points)

4. What is the Object class in Java? Explain the danger in using it as the type for a linked list (10 points)