One parallel algorithm for electing a leader from a pool of processors involves each processor comparing its processor ID number with its neighbor. The higher numbered processors hold another round,...

Extracted text: One parallel algorithm for electing a leader from a pool of processors involves each processor comparing its processor ID number with its neighbor. The higher numbered processors hold another round, and so on, until a single processor is left - the one with the highest ID number. What type of parallel algorithm is this? OEREW OCREW OERCW OCRCW Another algorithm for electing a leader has every processor writing its ID to the same location at the same time. They they all read the number stored in that location, and if it is the processor's ID, it knows it has been elected leader. What type of parallel algorithm is this? OEREW OCREW OERCW OCRCW