How can I prove my 2nd-shortest path algorithm?

Question

I\'m finding the 2nd-shortest path (the shortest path whose length is longer than the shortest path(s)) in a graph from the first vertix to the last one (single source and s