Consider an illiacmesh (8*8) ,a binary hypercube and a barrel shifter, all with the 64 nodes labelled n0,n1…n63.all network links are bidirectional.
a) State all the nodes reachable from node n0 in exactly three steps for each of the three networks?
b) Signify in each case tight upper bound on minimum number of routing steps required to transmit the data from any node ni to nj the other node.