$($a$)$ Outline between a prior and posterior analysis of the algorithm. $2$

$($b$)$ If $f(n)=nl$ then calculate big oh $(O)$ asymptotic notation of $f(n).$

$($c$)$ Calculate time complexity of the given code segment.

$)=1$;$in$;$i=(i^{**}2$