Consider a game of ladder climbing. There are 4 levels in the game, level 1 is the lowest (bottom) and level 4 is the highest (top). A player starts at the bottom. Each time, a fair coin is tossed. If it turns up heads, the player moves up one rung (staircase). If tails, the player moves down from any level to the very bottom. Once at the top level, the player moves to the very bottom if a tail turns up, and stays at the top if head turns up.States are as 1,2,3,4.

a) Run Monte Carlo simulation to find and print long-term fraction of times being in each state (i.e., steady-state probabilities) at the end of the code using python. Attach a py.file.