Questions:

$1.$ Can we use the shortest path algorithm to find two node$-$disjoint paths $($i$.$e$.,$ two paths without going through any same nodes other than the source and the destination$)$ between a pair of sourcedestination nodes in a given directed network with the minimum sum of the lengths of the two paths? If yes, show how we can calculate these two paths using the shortest path algorithm; otherwise, discuss what algorithm$($s$)$ can solve the problem.

$($Notes: A directed network is a network where every link has a direction, and traffic can only go through that direction but not the opposite one. We assume that every link has a positive link length.$)$