1. Name the Big-0 run-times for each of the following operations (hint: think about the form of the algorithm for the operation):
2. 1. Sequential search for an item
   2. Determine the maximum element in a list
   3. Compute the factorial of a number
   4. Open a data file and read the first item in it
   5. Append a new record to a file
   6. Insertion sort
   7. Selection sort
   8. Binary search for an item
   9. Determine the mean of all the elements in an n x n table
   10. Determine the column totals of all the elements in an n x n table
   11. Find all of the reorder in a file that match specified user requirement
   12. Determine the number of records in a binary file
   13. Swap the first and second elements in an array
   14. Remove the first element in an array and move all other elements forward one component in the array
   15. Insert a new element into the next available component of an array (assume that all cells up to some point are filled).

1. Assume that a segment of code is executed when the problem size is n = 100 and the execution time is 0.002 seconds. Determine the approximate expected execution time if the same segment of code executed when the problem n = 10,000 and the algorithm is:

a.0(1) b. 0(n) c. 0(n²) d. 0(log₂n)