G is a directed, weighted graph $($shown below$).$

S$->$A $=3$

A$->$B $=4$

A$->$C $=-1$

C$->$S $=-4$

S$->$C $=-1$

Execute Bellman$-$Ford$$s algorithm $($to completion$)$ using vertex S as the source, where the edges are processed in the following order:

SA$,$ SC$,$ AB$,$ AC$,$ CS

You must show how when a distance attribute and parent attribute are updated, and list when any edges result in no changes. You must show the current edges of the SSSP tree.

The value of C$.$parent is updated how many times in total before the Bellman$-$Ford algorithm terminates?