Find the worst case runtime f(n) for the following algorithms.
• Specify the number of operations executed for an input size n. for the worst case run time as a function of n. • Circle statement(s) and draw a line to the right side specifying the number of operations. • If statement(s) are a part of an iteration of n. specify the total number of iterations as a function of n.

Attachments:

question.PNG

q-2.PNG

submission-in….png