DATA STRUCTURES PLZ SOLVE Q$1)($a$)$ What's is the result of the following postfix? Show the stack at the various stages of

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$nkk{n}_{{?}_{?}}j=j+10j=j+10j=j**4i**=2j=j+10j=j^{***}4\frac{n}{2}\frac{n}{6}+15nlo{g}_3{n}_{?}5nlog{n}_{{?}_{?}}n+5,n^{\frac{1}{3}},n^{2}log(n),(1\mathrm{.}1{)}^n,n^{2\mathrm{.}5},(lo{g}_5{n}^2{)}^3(logn{)}^k$