Levenshtein Distance: Inferring the edit operations from the matrix

I wrote Levenshtein algorithm in in C++

If I input:
string s: democrat
string t: republican

I get the matrix D filled-up and the number of operations (the Levenshtein distance) can be read in D[10][8] = 8
Beyond the filled matrix I want to construct the optimal solution. How must look this solution? I don't have an idea.
Пожалуйста, напишите мне, КАК ДОЛЖЕН СМОТРЕТЬ этот пример.