(Solved): Part II. Algorithmic Efficiency (50 points) What is the algorithmic efficiency for each of the fol ...

Part II. Algorithmic Efficiency (50 points) What is the algorithmic efficiency for each of the following blocks of code using Big-C notation? Assume that all variables are properly declared and that all needed libraries have been included. \( O(1) \) - constant or bounded time \( O(n) \) - \( \quad \) linear time \( O\left(n^{2}\right) \) - \( \quad \) quadratic time \( O\left(n^{3}\right) \) - cubic time \( O(\log n)- \) logarithmic time \( O\left(2^{n}\right) \) - exponential time a. vector boris; b. \( \{ \) found \( = \) false; \( \mathrm{f}=0 \); last \( =n-1 \); while \( ((fa[loc]) \( \mathrm{f}=1 \circ \mathrm{OC}+1 \); else found=true; \} c. \( \quad \) sum=0; \( \mathrm{n}=3 \); \( \mathrm{k}=\mathrm{pow}(n, 2) \); for \( (i=0 ; i