(e) Calculate the frequency count of the following algorithm by showing the process of calculation and then determine the Big O. (1) result to for to ton result result + 1 end-for [3 marks) result to val 3 for 3 + 0 to (n-1) for kto to (n-1) print result result result + val end-for end-for [4 marks) (i) result O resultito val 3 for jo to (n-1) for ke i to n print result result + result + val end-for end-for for 1 0 ton resulti e resulti + val end-for [5 marks)