Hello, can I please get help with this python question? its supposedly logic flow like the third picture

Imagine the following: you're walking up the Empire State Building and you're playing a game with a friend. You throw a die one hundred times: if it's 1 or 2 you'll go one step down; if it's 3, 4, or 5, you'll go one step up; if you throw a 6, you'll throw the die again and will walk up the resulting number of steps. . Of course, you can not go lower than step number 0. And also, you admit that you're a bit clumsy and have a chance of 0.1% of falling down the stairs when you make a move. . Falling down means that you have to start again from step o. Which is the probability to reach 60th floor after 100 times you roll the dice? After 100,000 of trials, which is the trial in which 60th floor was reached that has the minimum rolled dice count? which is the maximum number of time you fell down within a trial? Use only random" and "math" modules . Don't use any lists or dictionaries In order to have more reliable results, run 100,000 iterations Your Python code should produce something like this Probability to reach 60th floor: 87.85% Max fall per iteration: 3 Min steps to reach 60th floor: 14, occurred by first in trial 87981 S Roll Dice 1 + Try to code it in Python Roll Dice 2 F Sum Dice 1 and Dice 2 IN Increment Sequence 100k Times? y Print Sequence