Q$1)($a$)$ What's is the result of the following postfix? Show the stack at the various stages of Secondly, do not ignore the base of the log$.$ So if a piece of code runs $5_{n}lo{g}_{3}n,$ you

should not write it like: $5_{n}lo{g}_n.$

So$,($a$)$ Don't ignore multiplicativ$$ constants, and $($b$)$ Don't ignore the base of the logs

Q$4)$ Order the following functions in ascending order of growth $($That is$,$ the function that

grows the slowest growing function comes first$)$:

$n^{+5},n^{\frac{1}{3}},n^{2}log(n),{(}^1.{)}^n,n^{2\mathrm{.}5},(lo{g}_{5n^2}^3)$

NOTE: $log(n_n)={?}_{k}log(n),$ and therefore have the same order of growth. However, $(lo{g}_n{)}_k$ of course

has a different order of growth as you would already know.

scanning the input postfix, the way it was done in class. $($Each time the stack changes, show

the stack$).$

$62+153-+$

$($b$)$ In O$-$notation, what is the time complexity of this algorithm that evaluates postfix

expressions $($Where $n$ is the length of the given postfix string$).$

Q$2)($a$)$ Write a function: "reverseStack$($Stack$nkknj=j+10j=j+10j=\frac{j}{4}i=2j=j+10j=\frac{j}{4}\frac{n}{6}\frac{n}{6}O(n)\frac{n}{6},\frac{n}{6}+1$