import timeit

start = timeit.default_timer()

# do whatever you are doing that you need to time taken = (timeit.default_timer() - start

Here is also a link that provides a quick summary of the Edit Distance algorithm: https://en.wikipedia.org/wiki/Edit_distance

Above used as reference, need help with Task 1. Thank you :)

Task 1 Consider the edit distance problem discussed in the lectures. 1. Based on the Edit Distance algorithm given in the lectures create a function that finds the sequence of transformations required to transform one string into another 2. Rewrite the Edit Distance algorithm given in the lectures to find the minimum cost of transforming one string into another when you have different costs for substitutions, deletions and insertions. These costs should be given as parameters of your algorithm. 3. Implement a purely recursive solution for the edit distance problem, and compare the running time to the Dynamic Programming solution studied in the lectures. Do this by using the technique used in Task 2 of the week 6 workshop, i..e, using the timeit module and generating random instances of the