3. (a) For each of the two algorithm fragments below, calculate how many times the code A is executed and how many times the code B is executed. For each answer, give the exact number and the complexity class using notation. i. for 1 ton do for kito n do B A ii. for i1 to (n - 1) do for j(i+1) to n do A B for k(i+1) to n do A B [20 marks] (b) Show that the For-loop construct is unnecessary. That is, show that every instance of for 1 to n do Body can be simulated using a While-loop. [15 marks] (c) A conditional iteration construct used in many programming languages is the Repeat construct: repeat Body until Cond Design an algorithm, using the Repeat construct, for finding the largest element of a non-empty array A[1...n] of numbers. Explain, with justification, which loop construct would be the most appropriate for this algorithm. [15 marks]