3. Find the worst-case time complexity (b-O) for the following codes with all details: a) Attn: 2nd loop depends on the 1st one. for i-1 to n do for j + 1 to i do operation end for end for b) for i 1 ton do operation k-n while k 1 do operation k-k/3 end while end for for i-1 to n do operation end for