(((Don't copy the answer from others because this is a different question )))

please write the answer from your keyboard so I can copy it.

please Don't put any images answer.

3 Analysing Algorithmic Efficiency (Marks: 2) Analyze the following code fragment and provide an asymptotic (O) bound on the running time as a function of n. You do not need to give a formal proof, but you should justify your answer. 1: foo 0 2: for i= 0 to n do 3: foo - foo X 4 4: for j - 1895 to 2021 do 5: for k - i to n - 1 do 6: for 1 - 2i+ 1 to 5i+ 6 do 7: foo - foo x 1 8: end for 9: end for 10: end for 11: end for