1) Consider the following pseudocode algorithms and give tight upper bounds to their complexity. Justify your answers

a) read n, where n is a nonnegative integer number for i = 1to n do: print i end for

b) read s, where s is a string of symbols set k to the length of s set times to 2k for i = 1 to times do: print i end for

c) Assume that di, where 0 i n, is a single symbol. read n, where n is a nonnegative integer number for i = 1 to n do: read di end for for i = 1 to n do: print di end for