Given a mesh of p x p processors. Note that Exactly-One Partial Permutation Routing (EOPPR) is a special case of general

[answerhappygod]

Given a mesh of p x p processors. Note that Exactly-One Partial
Permutation Routing (EOPPR) is a special case of general routing
problem. In EOPPR, each processor is the origin (and destination)
of exactly one packet. This problem can be solved in <= 2(p-1)
steps using Algorithm PPR given in the class. Note that there are
always totally p x p packets.
Give a best case and a worst case of using Algorithm PPR for a mesh
of 5 x 5 processors. That is,
(a) give a case that the run time is 1 for a mesh of 5 x 5
processors, and
(b) give a case that that the run time is 2(5-1) = 8 for a mesh of
5 x 5 processors.