"please follow all the instructions before attempting this question, other wise I don't upvote you"

1) please write in python.

2)**this is very important*** please explain all steps of your algorithm in comments

3) ***this is also very important** please provide time complexity of bisection method (by using comments)

4) provide the screenshot of test run of code.

5) Do not direct copy from chegg or any other

internet resources.

you can take more than 2 hours ,i don't mind but algorithm should be correct

Write a program to find a root of the following function using Bisection Method. The assigned function is f(x) = cos(x) + exp(-x) = Define a function named bisect (a,b,eps) to find the root of your assigned function via iterative bisection. The functions are evaluated in the interval [a, b]. and should give a result with tolerance eps. The output of your function should be a 3-tuple (Found, Value, IterList). 1) Found (type bool): denotes if there is a root of the function in the given interval 2) Value (type float): the root of the function in the given interval, if it exists 3) IterList (type float list): denotes the series of approximate results as the iteration converges towards the root (or when you exit the loop). Constraints: Found=True implies f(Value)