Why does the flow model limit how many times you can do something?

Please type thank you!   Tasks: 1. Write a python program that implements the estimation of Pi through a Monte Calo simulation.     1)  How many iterations do you need to run? make a case for when it is a good approximation of Pi.       2)  Suggest a method that would accelerate the approximation of Pi. You may either suggest a method that would accelerate the approximation of Pi than the method you described in b, or you may describe two methods and explain which one can accelerate the approximation of Pi than the other one.

Part C: Function, for and plotting We did a project in the lecture on calculating the free fall speeds and plotting them on a graph. This part is similar to the project. An engineer has derived a relationship between the force applied to a material and the extension in length that the force would cause. The relationship between force f and extension e is given by: You are asked to plot a graph showing the relationship between force and extension. You are asked to complete the following tasks: Task 1 Write a Python function which returns the value of e for a given input f. Do not use literals (e.g. 5.5, 10) in the expressions for e in the function. Instead you should define constants and use them. Note that the relationship between e and f depends on whether f is bigger than 10 or not, this means you need a certain Python construction in your function. If you can't think of that, have a look at Part A of Lab03.

you are missing the zero,running and stopped boolean expression. Please check the above solution.

Give an example of a while loop, then provide the equivalent do-while loop and for loop.  Then give a different example of a do-while loop, along with the equivalent while loop and for loop. Finally, give an example of a for loop, along with the equivalent while loop and do-while loop. Use your examples to illustrate the advantages and disadvantages of each looping structure, and describe those advantages and disadvantages.