I need the complete working solutions and accurate answers to this question. Thank you.

Problem 2. (25 points) How many times is function F called in the code segment below? Give an exact bound or a tight asympotic bound in big-O notation. Show your work. 1: for k 1 to n do 2: for i- 1 to k do 3: 4: 5: 6: 7 end for 8: end for for j=1 to i do end for