can you tell me which ones are wrong and why they are wrong. accompanied with the right answer and why thats the answer.

1. What are the two types of complexity we discussed in class for assessing algorithms? tims complexity Sowes complexity 2. What is the Big-O of the following? [Careful! Tricky (A) O(1) (B) O(lgn) (C) O(n) (D) O(n2) (E) Other Concatenating n strings with the 't' operator 3. Suppose we define a static method totalsvenLoc () that returns the total of even-index items of an integer List as shown on the right. What is the Big-O running time of the method if 1 st is a LinkedList of size N? 4. The two programs below are very similar, but they are not the same, select the correct Big-0 runtime for each in the worst case