$($b$)$Formally derive the run time of the each algorithm below as a function of n and determine its Big$-$O upper bound. You must show the derivation of the end result; if all you do is state the Big$-$O bound, you$$ll receive zero points.