1) [8 marks] Give a big-O estimate for the number of operations, where an operation is a comparison, print or a multiplication, used in these segments of algorithms. Ignore comparisons used to test the conditions in the while and for loops. a) while (i 1) for i:= 1 to s ize print(i) c) while (n > 0) ( for j 0 to n-1 print (j)