I need help with problem 5

5 for i-0 to n-1 do 6 7 8 9 end for k 0 to j do total-total + Alk] end 10 | if B[i] == total then count count1 12 end 13 end 14 return count (4) (10 pts) Show that i2 is 0(n3). (5) (a) (10 pts) Show that the summation logi s 0(n log n). (b) (10 pts) Show that the summation -1 log i is (n log n)