Comp Sci Algorithms help.

Please Read the problem carefully and understand it!! If you handwrite everything, please be legible!! Thank you for your help:) if you have any questions please ask!!

Original Answers only please, any copied answers will be disliked appropriately!

10) Give a tightest possible bound for the runtime complexity of the following C code fragments in terms of the value of the input size n. Just write down the expression. You don't have to simplify it. = for (i n; i > 0; i--){ for (j 0; j