Assess the worst case of algorithm efficiency as $O(f(n))($Note that $f(n)$ is a

function of $n)$ notation of the following algorithm's segments:

Please give in detailed explanation on the problem, not just the answers. Thank you!

Segment $2$: