$3.(25$ points$)$ Modify the code so that each byzantine general $($except the commander$)$ sabotages the consensus of honest generals by relaying two conflicting messages whenever it receives a verified message. Then, test your code by running it three times for no$\_$of$\_$generals $=7,$ and byzantine$\_$prob $=\mathrm{.}5.$ Record and report the result. Does the given algorithm fail to provide consensus?