q1 c

(c) Calculate the frequency count of the following algorithm by showing the process of calculation and then determine the Big O. (i) result to for jt o ton result t result +j end-for [3 marks] (11) result to valt 3 for j foto (n-1) for kto to (n-1) print result result t result + val end-for end-for [4 marks] (11) result to resultito val 3 for jo to (n-1) for kt i ton print result result t result + val end-for end-for for 1 o ton resultit resulti + val end-for [5 marks)