$1.$ Choose a random group assignment:

$-$ Bellman$-$Ford $($Section $22\mathrm{.}1)$

$-$ Single$-$source shortest paths in DAGs $($directed acyclic graphs$)($Section $22\mathrm{.}2)$

$-$ Dijkstra's $($Section $22\mathrm{.}3)$

$2.$ In your group, do the following to explain your assigned algorithm:

$1.$ Give a description of your algorithm $($in English$).$ Include any constraints that the algorithm has.

$2.$ Provide pseudocode for your algorithm

$3.$ Detail the execution of your algorithm for each of the following graphs $($with A as the source$)$:

$\backslash (\backslash$mathrm$\{$G$\}\_\{2\}\backslash )$

$\backslash (\backslash$mathrm$\{$G$\}\_\{3\}\backslash )$