4) How many times is function F called in each code segment given below? Clearly explain your answer and express the bounds in terms of n in big-O notation Assume n = 2k Code Segment 1 for i 1 to n do for j 1 ton by k do = for 1 toj do F(i, j) Code Segment 2 while n10 do i=1 while in do F(i, k) i=i*k n = n/2