3. Provide a tight bound on the the worst case runtime for the following algorithms. The grading criteria is as follows (note, "answer" refers to the tight bound equation): riteria 100% 75% 50% Provide correct answer as well as explanation Provide correct answer but incomplete correct explanation Provide wrong answer but mostly correct explanation Provide correct answer but mostly wrong explanation Provide wrong answer and mostly wrong explanation No answer, or only answer without sufficient explanation 0% 0% (a) (5 points) Require: n >1 2 while yo : for (i-1i