Write an algorithm to take the patience sorting stacks and get the sorted data from them. In principle, if your number of stacks is k and if your original list had length n$,$ then your extra algorithm, after patience sorting is done, should take at most order O$($n$*$k$)$ flops. Add your algorithm to the patience$\_$sort$\_$stack$\_$heights.ipynb notebook $($or a $.$py file if you are using a different implementation$).$

Photo is of patience$\_$sort$\_$stacks.ipynb.