$1.$ In python, write a simple Monte Carlo simulation to compute the height distributions of two particles moving in the same $1$d potential but with the added constraint that particle $2$ must always stay above particle $1.$

$2.$Extend your simulation to work for a chain of $10$ particles $($or$,$ ideally, an arbitrary number N$)$ such that each particle cannot move below the previous one.