For each pseudo-code below derive the simplified asymptotic running time in Q(?) notation. (a) for it 1 .. n do for j = 1.. 2*i do print( i+j) (e) for it 1 .. n do jc1 while jsi do jr j+j (k) for it 1 .. n do jun while i