Users will always expect good performance from their applications whether they are distributed or not. This, of course, is why we often need to choose (or develop)more efficient algorithms. In a distributed system, algorithm efficiency is often significantly impacted by the need to communicate information between the different components of the distributed system (since these components are running on different machines).Different networks can have very different characteristics (as measured by both data transfer rate,informally referred to as bandwidth,and message latency). Do some Internet research to explore this issue. Begin by providing concise definitions for communication latency and bandwidth. Determine what might be rough expected values for latency and bandwidth for network communication over a LAN (Local Area Network),such as one built on Gigabit Ethernet,where hosts are within meters of one another and compare that to expected values for latency and bandwidth for network communication in a WAN (Wide Area Network) such as the Internet where hosts could be 20,000km apart.How do you think this affects the type of distributed applications you can realistically build in each environment?(Hint: be sure to think about the type and frequency of communication that might be needed between the application components.)Assuming that a server machine has 2.4GHz cores, that each instruction takes, on average,2.2 cycles to execute and that the service being provided in response to each client request takes 15,000 instructions to execute, approximately how many orders of magnitude difference is there between the compute time at the server for each request and the communication time when the server must be reached via a LAN vs. a WAN network with characteristics as determined earlier in this question.(Assume the messages exchanged are small.)What does this tell you about the way you must divide up a problem if it is to be solved using distributed computing while still providing acceptable response time to its users?