Using Big O notation, indicate the time requirement of each of the following tasks in the worst case. a. Computing the sum of the fi rst n even integers by using a for loop b. Displaying all n integers in an array c. Displaying all n integers in a sorted linked chain d. Displaying all n names in an array of linked chains e. Displaying one array element f. Displaying the last integer in a linked chain g. Searching an array of n items for a particular value by using a sequential search h. Searching an array of n items for a particular value by using a binary search i. Adding an item to a stack of n items j. Adding an item to a bag of n items