Using Big O notation, indicate the worst case time requirement of each of the following tasks. a. Computing the sum of the first 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 items in n linked chains of size n each
e. Displaying one array element
f. Displaying the last integer in a linked chain
g. Searching an array for one particular value
h. Searching a sorted array for one particular value
i. Adding an item to a stack of n items
j. Adding an item to a bag of n items