digraph g$\{$ A $->$ C $[$ label$=\text{'}9\text{'}]$; A $->$ D $[$ label$=\text{'}5\text{'}]$; A $->$ E $[$ label$=\text{'}8\text{'}]$; B $->$ A $[$ label$=\text{'}2\text{'}]$; B $->$ C $[$ label$=\text{'}1\text{'}]$; B $->$ E $[$ label$=\text{'}3\text{'}]$; C $->$ B $[$ label$=\text{'}7\text{'}]$; D $->$ A $[$ label$=\text{'}6\text{'}]$; D $->$ C $[$ label$=\text{'}3\text{'}]$; D $->$ E $[$ label$=\text{'}2\text{'}]$; E $->$ C $[$ label$=\text{'}6\text{'}]$; F $->$ C $[$ label$=\text{'}4\text{'}]$;$\}$

Find the shortest path using bellman$-$ford algorithm starting from A