Time complexity of Transform One String to Another (18.7)


#1

I am trying to understand the run time analysis of this algorithm, but I am confused as to why the number of edges is, in the worst case O(d^2).

Any help would greatly be appreciated.