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 aect the generality of your solution (i.e., assumption without loss of generality as discussed in class.)]

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 3: while i>1 do 4: for k1 to 2(i +j) +5 do F(j, k) 6 end for 9: end while Code Segment 2: 1: for j 1 to n do 3: hile k 1 do for r 1 to k do F(j,r) end for end while 8: 9 end for