How to modify Levenshtein algorithm, to know if it inserted, deleted, or substituted a character?

So I am trying to devise a spin off of the Levenshtein algorithm, where I keep track of what transformations I did in the string(inserted a, or substitute a for b). Example: Basically, say I am …