Consider Hypercube topology with 8 nodes then how many message passing cycles will require in all to all broadcast operation?

the longest path between any pair of finish nodes.

the longest directed path between any pair of start & finish node.

the shortest path between any pair of finish nodes.

the number of maximum nodes level in graph.

Consider Hypercube topology with 8 nodes then how many message passin

1.	Consider Hypercube topology with 8 nodes then how many message passing cycles will require in all to all broadcast operation?
A.	the longest path between any pair of finish nodes.
B.	the longest directed path between any pair of start & finish node.
C.	the shortest path between any pair of finish nodes.
D.	the number of maximum nodes level in graph.
Answer» E.