Problem $4(25$ points$).$ Consider the following directed graph where the length of each arc is denoted by a number next

to the arc.

$(10$ points$)$ Write down two paths from node C to node D with different lengths.

$(15$ points$)$ Find a shortest path from node A to node D$.$ You may use any method discussed in the class

$($including branch$-$and$-$bound algorithm, Dijkstra's algorithm, and Bellman$-$Ford algorithm$).$