Consider a message passing system, where N processors are connected together with an interconnection network like the figure below. As the figure shows, each N/P of processors are connected in a rD hypercubes, and then the two hypercubes are connected together using a bus. Imagine that only one node from each hypercube is connected to the bus. This means that all communication to the other hypercube has to traverse through that one node. a. What is the number of processors, N? b. What is the bisection width of this network? C. What is the total cost of this network? d. What is the distance between the farthest nodes of this network? e Imagine that this system works with cut-through routing and we want to send a K-word message between the farthest nodes in this network (the nodes with the longest distance). if the per-hop time is 1 miliseconds (ms) and the packet overhead time is ims per word, find the total communication time for sending this message. Bus 4D Hypercube 1 40 Hypercube 2