A What are the time complexities of the following code segments? Explain how you get the answers. for i = 1 to n do for j = 1 to n do for k = 1 to no do a[i,j,k] = 0 B function comp (n) { if n 2 then return 1 return comp ( n / 2 ) }