# Stack Expansion

**Computer Science**Level 4

In such a stack, suppose we execute \(n\) push operations. The total cost complexity \(g(n,\alpha)\) of this operation can be asymptotically expressed as a function \(g\) in terms of \(n\) and \(\alpha\). If \[g(n,\alpha) = O( \large{ n^x \alpha^{y} )} \] for some exponents \(x\) and \(y\) . What is the value of \(10x^2 y^2\)?