Write a Stepping Quine Related

Your goal, is to write a set of programs, that progresses from one to the other, one character at a time. For example. Given the starting program abcd and the ending program wxyz, you should have 5 valid programs, with the respective outputs.

abcd -&gt; wbcd
wbcd -&gt; wxcd
wxcd -&gt; wxyd
wxyd -&gt; wxyz
wxyz -&gt; wxyz


As can be seen, the last program should be a quine.

Rules


Your start and end program may be any length, And they may also be different lengths
Your start and end program must contain entirely unique characters at each position, but may share characters overall.
Each program should affect a single character at a time, in any order, characters should only be added or removed from the end of the program.
None of your programs need to follow the valid quine rules, they only need to output the correct string.
Standard Loopholes Apply.


Scoring

Programs are scored by the length of the start program plus the length of the end program in bytes. In the previous example, 4 + 4 = 8, so the score is eight. This is code-golf, so shortest programs wins.

Some Valid Programs

In languages that hopefully don't exist

abcd -&gt; dbcd -&gt; dccd -&gt; dcbd -&gt; dcba
a -&gt; b
a -&gt; b -&gt; bc -&gt; bcd -&gt; bcde
ab -&gt; aa -&gt; ba
[BLANK PROGRAM] -&gt; a
xyz -&gt; xy -&gt; x -&gt; [BLANK PROGRAM]
Retina, Score 1


Try it online!

The empty program outputs 1, since the empty input matches the empty string exactly once.
1 outputs 0, since 1 doesn't match the empty input.
0 outputs 0, since 0 doesn't match the empty input. Since it outputs itself, it's a quine (as defined in this challenge).