Questions already answered. Just explain like I don't know anything please.

d) You are given the option to choose one of three algorithms with time complexities You want to choose the algorithm most likely to be the fastest. Which one will you choose? 0 .gk_(S e) Let T(N) +... . To which of the sets below does T(N) belong? P2. What can you tell about the time complexity of the code below (regardless of what someFunction does)? Give a lower, upper or tight bound (using , O, or ). Justify your answer. int k; for (k= 1 ; k