How many times is function F called in each code segment? Clearly explain your answer and express bounds in terms of n in big-O notation. Bounds should be as tight as possible. [Of course, you can make additional assumptions as long as they do not affect the generality of your solution (i.e., assumption without loss of generality as discussed in class.)] Code Segment 1: 1: i = n 2: j = 1 3: while i > 1 do 4: 5: 6: end for 7: i = [i/2] 8: j = 3j 9: end while for k=1 to 2(i+j) +5 do F(j, k)