Design analgorithm to achieve the Byzantine Agreement for the case that there are fourprocesses, amongst which one is corrupted. You should not use public keycryptography for your algorithm

Ques: Design an algorithm to achieve the Byzantine Agreement for the case that there are
four processes, amongst which one is corrupted. You should not use public key
cryptography for your algorithm
Solution:
In this type of agreement problems there are n processes that communicate with each other to
reach an agreement between the communicating parties on any binary value b. There could be a
bad processor or corrupt which prevents the admissible agreement between the communicating
parties.
For the current scenario there are 4 processes are at work, and one of the process is corrupt, all
these process have initial values. Even then...