Apply the following algorithm to the ring consisting of nodes $1,15,9,11,19,3,6,20,14,7,18,13,8,5,16,12,2,4,10$ and $17.$ Illustrate your solution using snapshots.

The Algorithm

To run for election:

status $$ "candidate"

maxnum $1$

WHILE status $=$ "candidate" DO

sendboth $("$from$",$ myvalue, $0,$ maxnum$)$

await both replies $($but react to other messages$)$

IF either reply is $"$no$"$ THEN status $$ "lost"

maxnum $2*$maxnum

OD

On receiving message $("$from$",$ value, num, maxnum$)$:

IF value $<$ myvalue THEN sendecho $("$no$",$ value$)0$

IF value $>$ myvalue THEN DO

status $$ "lost"

num $$ num $+1$

IF num$<$ maxnum THEN sendpass $("$from$",$ value, num, maxnum$)$

ELSE sendeecho $("$ok$",$ value$)$

OD

IF value $=$ myvalue THEN status $$ "won"

On receiving message $("$no$",$ value$)$ or $("$ok$",$ value$)$

IF value $=/=$ myvalue THEN sendpass the message

ELSE this is a reply the processor was awaiting