Consider an illiacmesh (8*8) ,a binary hypercube and a barrel shifter, all with 64 nodes labeled n0,n1...n63.all network links are bidirectional.
a) List all the nodes reachable from node n0 in exactly three steps for each of the three networks?
b)Indicate in each case the tight upper bound on the minimum number of routing steps needed to send data from any node ni to nj another node .
c) Repeat part (b) for a large network with 1024 nodes.