Please answer the question. I will give the good feedback. THANK YOU SO MUCH. $(20$ pts$)$ Consider the study of replica voting algorithm you had done as part of the first warm$-$up

project. For an extended analysis, Figure $4$ shows the key performance results of the voting algorithms.

The performance parameters are the time to deliver a data to the end$-$user $($TTC$).$ the number of distinct

data proposals before effecting a data delivery, and the control message overhead expended to deliver

a data. One of the influential parameters is the fault severity of a mis$-$behaving voter: denoted as a

parameter $r,$ where $r$ is the probability that a faulty device does in fact behave incorrectly. For e$.$g$.,$

$r=0\mathrm{.}1$ means that a faulty device $x$ behaves incorrectly only for $10\%$ of the times $x$ participates in

the algorithm operations $-$ which means that $x$ behaves correctly for $90\%$ of the times. The results

are shown for a case of $r=0\mathrm{.}5.$ Empirically plot the results for two other cases: $r=0\mathrm{.}1$ and $r=0\mathrm{.}8.$

Show the plots on top of the results given for $r=0\mathrm{.}5.$

$N=10$;

# of YES votes needed $=6$;

$(Tc)=50$ mec ;$(Tc)=50$msec;

fm : # of faulty devices

control message: $50$ bytes $T_c$ : voter computation time

network loss $I=4\%$

Figure $4$: Experimental performance results of replica voting algorithm