Copy the bisect function and modify it to create a false position function. Compute the possible transit times and the number of iterations required to find these times as described below. Use an error tolerance of $0\mathrm{.}0004\%.$ You will need to modify both functions to include the number of iterations as a return value from the function. Modify the false position function to add a max iteration parameter. If the number of iterations exceeds the maximum number of allowed iterations, the algorithm should stop and return the current value for the root.