Assume that the depth-first search algorithm with neighbor knowledge is used in a system where each process knows not only the identi ties of its neighbors but also the set of all process identities (JP) . Show that messages of N bits each are sufficient in this case.
Text Book: Introduction to Distributed Algorithms By Gerard Tel.