Use the dynamic programming algorithm discussed in class to find the

edit distance between the following two words: Dartmouth, Swarthmore

i$.$ Fill out the dynamic programming table

D a r t m o u t h

$0$

S

w

a

r

t

h

m

o

r

e

ii$.$ Highlight the optimal path in the DP table

$2$

iii. Write out one optimal edit transcript