Provide the FSM$-$based version of Rank$\_$MCVC algorithm described in Sect. $13\mathrm{.}2\mathrm{.}3,$

which finds the MCVC by greedily selecting the remaining highest degree nodes. Provide

its FSM diagram, a pseudocode and work out the time and message complexities. Show

also step$-$by$-$step execution of this algorithm in the example graph of Fig. $13\mathrm{.}12.$

Fig. $13\mathrm{.}12$ Example graph

for Exercise $2$