(c) Calculate the frequency count of the following algorithm by showing the process of calculation and then determine the Big O. (1) result to for jto to n result { result + j end-for (ii) result 0 val 3 for j toto (n-1) for kto to (n-1) print result result t result + val end-for end-for result 0 resulti + 0 valt 3 for jo to (n-1) for k ti to n print result result t result + val end-for end-for for 10 ton resultit resulti + val end-for