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

You need a reliable network for about twenty-five computers that will be distributed across a large building. it is important that the network be relatively cheap. which topology should you use?

Whats three fourths of 15(this is supposed to be in math but i clicked too fast)

1. ask the user how many questions are in the quiz. 2. ask the user to enter the key (that is, the correct answers). there should be one answer for each question in the quiz, and each answer should be an integer. e.g., 34 7 13 100 81 3 9 10 321 12 might be the key for a 10-question quiz. you will need to store the key in an array. 3. ask the user to enter the answers for the quiz to be graded. there needs to be one answer for each question. note that these answers do not need to be stored; each answer can simply be compared to the key as it is entered. 4. when the user has entered all of the answers to be graded, print the number correct and the percent correct. 5. add a loop so that the user can grade any number of quizzes with a single key. after the results have been printed for each quiz, ask "grade another quiz? (y/n)." note: you only have one array (the key). you are not creating a new key for each set of quiz answers.