please explain it.We were unable to transcribe this imagewhen START() is received do % only pa receives this message % (1) parent; i; (2) let k e neighbors;; (3) send Go({i}, i) to pk; first; k. when Go(visited, last) is received from pi do (4) parent; + j; succ; last; (5) if (neighbors, C visited) then send BACK(visited U {i}, i) to P;; routing;[j] else let k e neighbors; visited; (8) send GO(visited U {i}, i) to Pk; routing;[k] (9) end if. when BACK(visited, last) is received from p; do (10) if (neighbors; visited) (11) then if (parent; = i) (12) then succ; last; routing; first;] j % the ring is built % else send BACK(visited, last) to Pparent, i routing;[parent] =j (14) end if (15) else let k e neighbors, visited; (16) send GO(visited, last) to pki routing;[k] (17) end if. (13) Fig. 1.19 From a depth-first traversal to a ring (code for p) Show transcribed image text
when START() is received do % only pa receives this message % (1) parent; i; (2) let k e neighbors;; (3) send Go({i}, i) to pk; first; k. when Go(visited, last) is received from pi do (4) parent; + j; succ; last; (5) if (neighbors, C visited) then send BACK(visited U {i}, i) to P;; routing;[j] else let k e neighbors; visited; (8) send GO(visited U {i}, i) to Pk; routing;[k] (9) end if. when BACK(visited, last) is received from p; do (10) if (neighbors; visited) (11) then if (parent; = i) (12) then succ; last; routing; first;] j % the ring is built % else send BACK(visited, last) to Pparent, i routing;[parent] =j (14) end if (15) else let k e neighbors, visited; (16) send GO(visited, last) to pki routing;[k] (17) end if. (13) Fig. 1.19 From a depth-first traversal to a ring (code for p)
Expert Answer
Answer to when START() is received do % only pa receives this message % (1) parent; i; (2) let k e neighbors;; (3) send Go({i}, i)…