Please attach the proper explanation

3. Name the Big-o run-times for each of the following operations (hint: think about the form of the algorithm for the operation): C. a. Sequential search for an item b. Determine the maximum element in a list Compute the factorial of a number d. Open a data file and read the first item in it e. Append a new record to a file f. Insertion sort 8. Selection sort h. Binary search for an item i. Determine the mean of all the elements in an n xn table j. Determine the column totals of all the elements in an n x n table k. Find all of the reorder in a file that match specified user requirement I. Determine the number of records in a binary file m. Swap the first and second elements in an array n. Remove the first element in an array and move all other elements forward one component in the array Insert a new element into the next available component of an array (assume that all cells up to some point are filled). o