Consider nelements that are equally distributed in $k$ stacks, In each stack, elements of it are antanged in ascending order $($min is at the top in etich of the stack and then increasing dowmwards$)$ Given a queve of size $n$ in which we have to put all $n-$elements in increasing order. What wil be the time complexity of the best known aiponthin?

Your answer:

$($ornk$)$

$(B{n}^2)$

on logk