Consider a path between source and destination, which consists of n intermediate nodes. Assume that each node uses store and forward technique to send messages from the source to destination. Suppose that the message length is L bits and the message is divided into N packets, and H bits of header information are added to each packet. If each link along the path transmits at rate R bits/sec. Show that: a) Transmission time for the message assuming no pipelining T=N(n+1)((L/ N) + H)/ R b) Transmission time of the message with pipelining